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


public class Q2 {
    
    public static void main(String[] args) {
        Scanner s = new Scanner(System.in);
        int T = s.nextInt();
        for (int i = 0; i < T; i++) {
            int N = s.nextInt();
            int S = s.nextInt();
            int P = s.nextInt();
            int[] scores = new int[N];
            for (int j = 0; j < N; j++) {
                scores[j] = s.nextInt();
            }
            System.out.println("Case #" + (i + 1) + ": " + numAboveMax(scores, S, P));
        }
    }

    private static int numAboveMax(int[] scores, int S, int P) {
        Arrays.sort(scores);
        int surprises = 0;
        int result = 0;
        if (P > 1) {
            for (int i = scores.length - 1; i >= 0; i--) {
                if (scores[i] > (3 * P - 3)) {
                    result++;
                } else if ((scores[i] > (3 * P - 5)) && (surprises < S)) {
                    result++;
                    surprises++;
                }
            }
            return result;
        } else if (P == 1) {
            for (int i = scores.length - 1; i >= 0; i--) {
                if (scores[i] > 0) {
                    result++;
                }
            }
            return result;
        } else {
            return scores.length;
        }
    }
}
