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


public class DancingwithGooglers {
	public static void main(String args[]) throws IOException{
		String inputFile  = args[0];
		String outputFile = args[1];
		BufferedReader input  = new BufferedReader(new FileReader(inputFile));
		PrintWriter    output = new PrintWriter(outputFile);
		
		int testcases = Integer.valueOf(input.readLine());
		int testcase = 0;
		while (testcase++ < testcases) {
			int result = 0;
			String newline = input.readLine();
			String[] tokens = newline.split(" ");
			int N = Integer.valueOf(tokens[0]);
			int S = Integer.valueOf(tokens[1]);
			int p = Integer.valueOf(tokens[2]);
			int i;
			for (i = 0; i < N; i++) {
				int score = Integer.valueOf(tokens[i + 3]);
				int highest = (score + 2) / 3;
				int possible = (score + 4) / 3;
				if (highest >= p)
					result++;
				else if (possible >= p && possible <= score && S > 0) {
					result++;
					S--;
				}
			}
			
			output.printf("Case #%d: %d\n", testcase, result);
		}
		
		output.close();
	}
}
