/**
 * 
 */
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.util.Arrays;
import java.util.Scanner;


public class ProblemB {

	public static void main(String[] args) throws Exception {
		
		Scanner leitor = new Scanner(new File("problemBTest.in"));
		int n = leitor.nextInt(); leitor.nextLine();
		for (int i = 0; i < n; i++) {
			int dancers = leitor.nextInt();
			int surp = leitor.nextInt();
			int min = leitor.nextInt();
			int notas[] = new int[dancers];
			for (int j = 0; j < dancers; j++) {
				notas[j] = leitor.nextInt();
			}
			leitor.nextLine();
			Arrays.sort(notas);
			
			int resultado = 0;
			
			int j = 0;
			for (j = dancers-1; j >=0; j--) {
				if (notas[j] > (3 * (min-1))) {
					resultado++;
				} else {
					break;
				}
			}
			
			while (surp > 0 && j >= 0) {
				if ((min-2) >= 0) { 
					if (((notas[j] - min - (min-2)) >= (min-2)) &&
						((notas[j] - min - (min-2)) < (min+2))	) {
						resultado++;
						surp--;
					}
				}
				j--;
			}
			System.out.println("Case #" + (i+1) + ": " + resultado);
		}
	}

}
