import java.util.List;


public class Case implements Runnable {

	private int id;
	private String output;

	private int n;
	private int s;
	private int p;
	private List<Integer> g;

	public Case(int id) {
		this.id = id;
	}

	public Case(int id, int n, int s, int p, List<Integer> g) {
		super();
		this.id = id;
		this.n = n;
		this.s = s;
		this.p = p;
		this.g = g;
	}

	public String solve() {
		int res = 0;
		for (int googler : g) {
			int b = googler / 3;
			boolean div = googler % 3 == 0;
			if (b >= p) {
				res++;
				continue;
			}
			if (p == b+1) {
				if (div && s > 0 && b > 0) {
					res++;
					s--;
					continue;
				}
				if (!div) {
					res++;
					continue;
				}
			}
			if (p == b+2) {
				if (3*b+2 == googler && s > 0) {
					res++;
					s--;
				}
			}
		}
		return String.valueOf(res);
	}

	@Override
	public void run() {
		output = solve();
	}

	@Override
	public String toString() {
		return "Case #" + id + ": " + output;
	}

}



public class DancingWithTheGooglers extends ProgrammingProblem
{

  static int min[] = { 0, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10 };
  static int max[] = { 0, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 10, 10 };

  int N, S, p, t[];

  @Override
  protected void print()
  {

  }

  @Override
  protected void readInput()
  {
    N = sc.nextInt();
    S = sc.nextInt();
    p = sc.nextInt();
    t = new int[N];
    for (int i = 0; i < N; i++)
    {
      t[i] = sc.nextInt();
    }
  }

  @Override
  protected String execute()
  {
    int c = 0;
    for (int i = 0; i < N; i++)
    {
      if (min[t[i]] >= p || (max[t[i]] >=p && S-- > 0 ))
      {
        c++;
      }
    }

    return c + "";
  }

  public static void main(String[] args) throws Exception
  {
    DEBUG = false;
    main(DancingWithTheGooglers.class);
  }
}
