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

public class Dancers {

    public static void main(String[] args) throws FileNotFoundException, IOException {
        Scanner sc = new Scanner(new File("D:/testing/B-small-attempt0.in"));
        BufferedWriter bf = new BufferedWriter(new FileWriter("D:/testing/b.txt", false));

        int T = sc.nextInt();
        for (int i = 1; i <= T; i++) {
            int N, S, p;
            int hscr = 0, mscr = 0;
            N = sc.nextInt();
            S = sc.nextInt();
            p = sc.nextInt();

            for (int j = 0; j < N; j++) {
                int scr = sc.nextInt();
                if (scr > 3 * (p - 1)) {
                    hscr++;
                } else if (p>1 &&  scr > 3 * (p - 2) + 1) {
                    mscr++;
                }
            }
            int max=hscr+ Math.min(S, mscr);
             System.out.println("Case #" + i+": "+max);
             bf.write("Case #" + i+": "+max+ "\n");
        }
        bf.close();
    }
}
