/**
 * 
 */
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.File;
import java.io.FileNotFoundException;
import java.io.PrintStream;
import java.util.ArrayList;
import java.util.Scanner;


/**
 * @author Paul LaMotte
 *
 */
public class GooglerDance {

	public static void main(String[] args) {
		
		Scanner in;
		try {
			System.setOut(new PrintStream(new File("qualB.out")));
			in = new Scanner(new File("B-small-attempt2.in"));
			int lines = Integer.parseInt(in.nextLine());
			for (int i = 0; i < lines; i++) {
				int googlers = in.nextInt();
				int trips = in.nextInt();
				int best = in.nextInt();
				int count = 0;
				ArrayList<Integer> scores = new ArrayList<Integer>();
				for (int j = 0; j < googlers; j++) {
					int score = in.nextInt();
					int rem = score - best;
					int tmp = (int)Math.floor(rem / 2);
					if (score < best) {
						continue;
					}
					if (best - tmp <= 1) {
						count++;
					} else if (best - tmp <= 2 && trips > 0) {
						trips -= 1;
						count++;
					}
				}
				
				System.out.printf("Case #%d: %d\n", i + 1, count);
			}
		} catch (FileNotFoundException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}	}
}
