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.util.*;

class ProbB {
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		StringBuilder out = new StringBuilder();
		int numCases = in.nextInt();
		for(int count = 1; count <= numCases; ++count) {
			out.append("Case #" + count + ": ");
			int n = in.nextInt();
			int numSurp = in.nextInt();
			int p = in.nextInt();
			int ans = 0;
			int possible = 0;
			int num = 0;
			for(int i = 0; i < n; ++i) {
				num = in.nextInt();
				if(num < p) {
					continue;
				}
				num = num - p;
				num = num / 2;
				if(num >= p-1) {
					++ans;
				}
				else if(num >= p-2) {
					if(numSurp > 0) {
						++ans;
						--numSurp;
					}
				}
				else {
					continue;
				}
			}
			out.append(ans + "\n");
		}
		System.out.println(out);
	}
}