/**
 * 
 */
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();

	}

}

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package dancing;

import java.io.File;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.Scanner;

/**
 *
 * @author Serban
 */
public class Input {
    
    PrintWriter out;

    public Input(String fileName) {
        //C-large-practice.in
        try {
            out = new PrintWriter(new File("result.txt"));
            Scanner scan = new Scanner(new File(fileName));
            int T = scan.nextInt();
            scan.nextLine();
            for (int i = 0; i < T; i++) {
                int N = scan.nextInt();
                int S = scan.nextInt();
                int p = scan.nextInt();
                int[] marks = new int[N]; 
                for(int j=0;j<N;j++) {
                    marks[j] = scan.nextInt();
                }
                solve(N, S, p, marks, i);
            }
            out.close();
        } catch (Exception e) {
            System.out.println(e.getMessage());
        }
    }
    
    private void solve(int N, int S, int p, int[] marks, int testCase) {
        out.print("Case #" + (testCase + 1) + ": ");
        int nr = 0;
        int leftS = S;
        for(int i=0;i<N;i++) {
            //System.out.print(marks[i]+" ");
            int c = marks[i];
            switch(p) {
                case 0:
                    nr++;
                    break;
                case 1:
                    if(c>=1)
                        nr++;
                    break;
                default:
                    if(c >= 3*p-2)
                        nr++;
                    else
                        if(leftS > 0 && c >= 3*p-4) {
                            nr++;
                            leftS--;
                        }
            }
        }
        System.out.println(nr);
        out.print(nr);
        out.println();
        out.flush();
    }
}
