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.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;

public class ProbB {

    public static void main(String[] args) throws Exception {
        FileReader fr = new FileReader("B-large.in");
        BufferedReader br = new BufferedReader(fr);

        FileWriter fw = new FileWriter("outB.txt");
        BufferedWriter bw = new BufferedWriter(fw);

        String a = br.readLine();
        int cases = Integer.parseInt(a);
        
        int n=0, s=0, p=0, num=0;
        
        for (int i = 1; i < cases+1; i++) {
            String testCase = br.readLine();
            String tokens[] = testCase.split(" ");
            n= Integer.parseInt(tokens[0]);
            s = Integer.parseInt(tokens[1]);
            p = Integer.parseInt(tokens[2]);
            
            int count = 0;
            for (int j = 3; j < n + 3; j++) {
                num = Integer.parseInt(tokens[j]);
                if ((num - p) >= 2 * (p - 1) && (num - p) >= 0) {
                    count++;
                } else if ((num - p) < 2 * (p - 1) && (num - p) >= 0) {
                    if (s != 0 && (num - p) >= 2 * (p - 2)) {
                        count++;
                        s--;
                    }
                }
            }
            String result = "Case #" + (i) + ": " + count;
            bw.write(result);
            bw.newLine();

        }

        bw.close();
        fw.close();

        br.close();
        fr.close();
    }
}
