/**
 * 
 */
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.File;
import java.io.FileReader;

public class Second {

	public static void main(String[] args) throws Exception {
		BufferedReader reader = new BufferedReader(new FileReader(new File(
				"/Users/narok119/Desktop/B-small-attempt1.in")));

		String txt = reader.readLine();
		int caseCount = 1;

		while ((txt = reader.readLine()) != null) {
			// Form the inputs
			String[] info = txt.split(" ", 4);
			int n = Integer.parseInt(info[0]);
			int s = Integer.parseInt(info[1]);
			int p = Integer.parseInt(info[2]);
			String[] input = info[3].split(" ");
			int[] number = new int[n];
			int output = 0;
			for (int i = 0; i < n; i++) {
				number[i] = Integer.parseInt(input[i]);
			}

			// Start calculating output
			for (int i = 0; i < n; i++) {
				if (p * 3 <= number[i]) {
					output++;
				} else if (2 * p + (p - 1) == number[i]) {
					output++;
				} else if (2 * (p - 1) + p == number[i]) {
					output++;
				} else if (s > 0 && p - 2 >= 0
						&& (p - 2) + (p - 1) + p == number[i]) {
					output++;
					s--;
				} else if (s > 0 && p - 2 >= 0 && (p - 2) + 2 * p == number[i]) {
					output++;
					s--;
				} else if (s > 0 && p - 2 >= 0 && 2 * (p - 2) + p == number[i]) {
					output++;
					s--;
				}
			}
			System.out.println("Case #" + caseCount++ + ": " + output);
		}
	}

}
