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

public class Main {
	private final static int N_MAX = 1024;
	
	public static void main(String[] args) {
		int T,N,S,P;

		Scanner stdin = new Scanner(System.in);
		T = stdin.nextInt();
		
		for(int i = 1;i <= T;++i) {
			N = stdin.nextInt();
			S = stdin.nextInt();
			P = stdin.nextInt();
			
			int[] score = new int[N];
			for(int j = 0;j < N;++j)
				score[j] = stdin.nextInt();
			Arrays.sort(score);
			
			int res = 0;
			
			for(int j = N - 1;j >= 0; --j)
				if(score[j] >= P * 3 - 2)
					++res;
				else if(P != 1 && score[j] >= P * 3 - 4 && S != 0) {
					++res;
					--S;
				}
			
			System.out.println("Case #" + i + ": " + res);
		}
	}
}
