/**
 * 
 */
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();

	}

}

/**
 * 
 */
package asem.googe.codejam.qround;

import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.io.PrintWriter;

/**
 * @author A.Alathwari
 * 
 * Problem B : 
 *
 */
public class ProblemB implements Runnable {
	
	asem.core.util.InputReader fin;
	java.io.PrintWriter fout;

	/**
	 * @param fin
	 * @param fout
	 */
	public ProblemB(asem.core.util.InputReader fin, PrintWriter fout) {
		this.fin = fin;
		this.fout = fout;
	}
	
	/**
	 * @param fin
	 * @param fout
	 * @throws IOException 
	 * @throws FileNotFoundException 
	 */
	public ProblemB(String fin, String fout) throws FileNotFoundException, IOException {
		this.fin  = new asem.core.util.InputReader(new FileReader(fin));
		this.fout = new PrintWriter(System.out);
	}
	
	/* (non-Javadoc)
	 * @see java.lang.Runnable#run()
	 */
	@Override
	public void run() {
		// TODO Auto-generated method stub
		try {
				
			for (int tNum = 1, inT = fin.readInt(); tNum <= inT; tNum++) {
				
				int N = fin.readInt();
				int S = fin.readInt();
				int P = fin.readInt();
				
				int [] googlers = new int [N];
				int y = 0;
				
				for (int i = 0; i < N; i++) {
					googlers[i] = fin.readInt();
					
					if (googlers[i] == 0) {
						if (P == 0)
							y++;
						continue;
					}

					if ((Math.ceil((double)googlers[i] / 3) >= P)) {
						y++;
						continue;
					}
					
					if (S > 0 && (Math.ceil((double)(googlers[i]-1) / 3) >= (P-1))) {
						y++;
						S--;
					}
				}

				System.out.println("Case #" + tNum + ": " + y);
			}
			
		} catch (NumberFormatException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}
	}
}