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;
	}

}
import java.io.BufferedReader;
import java.io.IOException;

public class TestTwoSolver extends SolverModule {

	public StringBuilder process(BufferedReader in, StringBuilder builder)
			throws IOException {
		in.readLine();
		String line = in.readLine();
		int count = 1;
		while (line != null) {
			line = processline(line);
			appendLine(line, builder, count);
			count++;
			line = in.readLine();
		}
		return builder;
	}

	private String processline(String line) {
		int[] lines = toIntegers(line.split(" "));
		int bestResultCount = 0;
		int S = lines[1];
		int p = lines[2];
		for (int i = 3; i < lines.length; i++) {
			if (lines[i] >= (p - 1) * 2 + p) {
				bestResultCount++;
			} else {
				if (lines[i] >= (p - 2) * 2 + p) {
					if (S > 0 && (p - 2) >= 0) {
						S--;
						bestResultCount++;
					}
				}
			}
		}
		return String.valueOf(bestResultCount);
	}

	private int[] toIntegers(String[] split) {
		int[] ints = new int[split.length];
		for (int i = 0; i < split.length; i++) {
			ints[i] = Integer.valueOf(split[i]);
		}
		return ints;
	}
}
