/**
 * 
 */
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.BufferedWriter;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.Scanner;

public class G_2 {

    static int n, s, p;
    static int[] tt;

    public static void main(String[] args) throws IOException {
        PrintWriter bw = new PrintWriter(new FileWriter("1.txt"));
        Scanner scan = new Scanner(System.in);
        int t = scan.nextInt();
        scan.nextLine();
        for (int i = 0; i < t; i++) {
            n = scan.nextInt();
            s = scan.nextInt();
            p = scan.nextInt();
            tt = new int[n];
            int a = 3 * p - 4;
            if (p == 1) {
                a = 1;
            }
            if (p == 0) {
                a = 0;
            }
            // int b = 3 * p + 4;
            int c = 3 * p - 2;
            // int d = 3 * p + 2;
            int count = 0;

            for (int j = 0; j < n; ++j) {
                tt[j] = scan.nextInt();
                if (c <= tt[j]) {
                    count++;
                    continue;
                }
                if (a <= tt[j] && s != 0) {
                    s--;
                    count++;
                    continue;
                }
            }

            System.out.println(String.format("Case #%d: %d", (i + 1), count));
            bw.write(String.format("Case #%d: %d\n", (i + 1), count));
        }
        bw.flush();
        bw.close();
    }
}
