/**
 * 
 */
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.BufferedWriter;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.ArrayList;

public class Dancing {

	public static int findmax(int N, int S, int p, ArrayList<Integer> googlers){
		int legit = 0;
		int surprise = 0;
		for(int g : googlers){
			if ( g >= (3*p) - 2){
				legit++;
			}
			else if(g > 0 && g >= (3*p) - 4){
				surprise++;
			}
		}
		return legit + Math.min(S, surprise);
	}//Dancing.findmax()


	public static void main(String[] args) throws IOException{

		String inputFile = args[0];
		String outputFile = args[1];
		File file = new File(inputFile);
		BufferedReader reader = new BufferedReader(new FileReader(file));
		BufferedWriter writer = new BufferedWriter(new FileWriter(outputFile));
		
		int numCases = Integer.parseInt(reader.readLine());
		
		for (int i = 1; i <= numCases; i++){
			int caseNumber = i;
			String[] arguments = reader.readLine().split(" ");
			int N = Integer.parseInt(arguments[0]);
			int S = Integer.parseInt(arguments[1]);
			int p = Integer.parseInt(arguments[2]);
			ArrayList<Integer> googlers = new ArrayList<Integer>();
			for(int j = 0; j < N; j++){
				googlers.add(Integer.parseInt(arguments[j+3]));
			}
			
			writer.write("Case #" + caseNumber + ": " + Dancing.findmax(N,S,p,googlers));
			writer.newLine();
		}
		reader.close();
		writer.close();
	}//Dancing.main()
}//Dancing
