import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Arrays;


public class GooglersDancer {

	/**
	 * @param args
	 * @throws IOException
	 */
	public static void main(String[] args) throws IOException {
		// TODO Auto-generated method stub
		InputStreamReader converter = new InputStreamReader(System.in);
		BufferedReader in = new BufferedReader(converter);
		if (in == null) {
		      return;
		    }
		String numTest = in.readLine();
		int maxCases = Integer.valueOf(numTest);
		for(int i=1;i<= maxCases;i++){
			String linea = in.readLine();
			String[] datos = linea.split(" ");
			Integer googlers = Integer.valueOf(datos[0]);
			Integer sospechosos = Integer.valueOf(datos[1]);
			Integer p = Integer.valueOf(datos[2]);
			Integer puntuacion;
			Integer personas = 0;
			ArrayList<Integer> puntuaciones = new ArrayList<Integer>();
			for(int j=0;j<googlers;j++){
				puntuacion = Integer.valueOf(datos[3+j]);
				puntuaciones.add(puntuacion);
			}
			Integer[] pOrdenado = null;
			pOrdenado = (Integer[]) puntuaciones.toArray(new Integer[puntuaciones.size()]);
			Arrays.sort(pOrdenado);
			int j;
			for(j=pOrdenado.length-1;j>=0;j--){
				if(pOrdenado[j] >= p*3-2){
					personas += 1;
				}else{
					break;
				}
			}
			int posibles = j+1-sospechosos;
			for(;j>=posibles && j>= 0;j--){
				if(pOrdenado[j] >= p*3-4 && pOrdenado[j] > p){
					personas += 1;
				}else{
					break;
				}
			}
			System.out.println("Case #"+i+": "+personas);
		}
	}

}


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

public class B {

    public static void main(String args[]) throws Exception {
        final String PATH = "/home/goalboy/software installation/codejam-commandline-1.0-beta4/source/";
        final String FILE = "B-large-0";
        Scanner in = new Scanner(new File(PATH + FILE + ".in"));
        PrintWriter out = new PrintWriter(PATH + FILE + ".out");

        int test = in.nextInt();
        for (int t = 1; t <= test; t++) {
            int N = in.nextInt();
            int S = in.nextInt();
            int p = in.nextInt();
            int totals[] = new int[N];
            int bests[] = new int[N];
            boolean addables[] = new boolean[N];
            for (int i = 0; i < N; i++) {
                totals[i] = in.nextInt();
            }
            Arrays.sort(totals);
            for (int i = 0; i < N; i++) {
                if (totals[i] % 3 == 0) {
                    bests[i] = totals[i] / 3;
                    addables[i] = (bests[i] > 0);
                } else if (totals[i] % 3 == 1) {
                    bests[i] = totals[i] / 3 + 1;
                    addables[i] = false;
                } else {
                    bests[i] = totals[i] / 3 + 1;
                    addables[i] = (bests[i] > 0);
                }
            }
            int result = 0;
            for (int i = N - 1; i >= 0; i--) {
                if (bests[i] >= p) {
                    result++;
                } else if (addables[i] && bests[i] + 1 >= p && S > 0) {
                    result++;
                    S--;
                }
            }
            out.println("Case #" + t + ": " + result);
        }

        out.close();
    }
}
