/**
 * 
 */
package pandit.codejam;

import java.io.BufferedInputStream;
import java.io.FileInputStream;
import java.io.FileOutputStream;
import java.io.IOException;
import java.io.OutputStreamWriter;
import java.io.Writer;
import java.util.Scanner;

/**
 * @author Manu Ram Pandit
 * 
 */
public class DancingWithGooglersUpload {

	/**
	 * @param args
	 * @throws IOException 
	 */
	public static void main(String[] args) throws IOException {
		FileInputStream fStream = new FileInputStream(
				"input.txt");

		Scanner scanner = new Scanner(new BufferedInputStream(fStream));
		Writer out = new OutputStreamWriter(new FileOutputStream("output.txt"));

		int T = scanner.nextInt();
		int N,S,P,ti;
		int counter = 0;
		for (int count = 1; count <= T; count++) {
			N=scanner.nextInt();
			S = scanner.nextInt();
			counter = 0;
			P = scanner.nextInt();
			for(int i=1;i<=N;i++){
				ti=scanner.nextInt();
				if(ti>=(3*P-2)){
					counter++;
					continue;
				}
				else if(S>0){
					if(P>=2 && ((ti==(3*P-3)) ||(ti==(3*P-4)))) {
					S--;
					counter++;
					continue;
					}
				}
				
			}
			// System.out.println("Case #" + count + ": " + counter);
			out.write("Case #" + count + ": " + counter + "\n");
		}
		fStream.close();
		out.close();

	}

}

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;

public class Dancing {

	private static BufferedReader bufferedReader = new BufferedReader(
			new InputStreamReader(System.in));

	public static void main(String[] args) throws IOException {
		String line = bufferedReader.readLine();
		int cases = Integer.parseInt(line);

		for (int i = 1; i <= cases; i++) {
			line = bufferedReader.readLine();
			String[] split = line.split(" ");

			int googlers = Integer.parseInt(split[0]);
			int surprises = Integer.parseInt(split[1]);
			int p = Integer.parseInt(split[2]);

			int[] totals = new int[googlers];
			for (int j = 0; j < googlers; j++) {
				totals[j] = Integer.parseInt(split[3 + j]);
			}

			Arrays.sort(totals);

			int answer = 0;
			int usedSurprises = 0;

			for (int j = 0; j < googlers; j++) {
				if (p == 0) {
					answer++;
				} else if (totals[j] >= p + 2 * (p - 1) && p >= 1) {
					answer++;
				} else if (usedSurprises < surprises) {
					if (totals[j] >= p + 2 * (p - 2) && p >= 2) {
						answer++;
						usedSurprises++;
					}
				}
			}

			System.out.println("Case #" + i + ": " + answer);
		}
	}

}
