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.File;
import java.io.FileWriter;
import java.util.Scanner;


public class Dancing {

	public static void main(String[] args) throws Exception {
		Scanner sc = new Scanner(new File("./src/input.txt"));
		FileWriter fw = new FileWriter("./src/output.txt");
		int total = sc.nextInt();
		for(int turn = 1; turn <= total; turn++) {
			int res = 0;
			int pos = 0;
			int N = sc.nextInt(), S = sc.nextInt(), p = sc.nextInt();
//				fw.write(N + " " + S + " " + p + "\n");
			for(int i = 0; i < N; i++) {
				int next = sc.nextInt();
//				fw.write(next + " " + (3*p-2) + "\n");
				if (next >= (3*p-2)) {res++;}
				else
					if ((p>=2) && (next >= 3*p-4)) {pos++;}
			}
			if (pos < S){res = res+pos;}
			else {res = res + S;}
			
			fw.write("Case #" + turn + ": " + res + "\n");
		}
		fw.flush();
		fw.close();
	}
}
