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);
		}
	}

}

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

import java.util.ArrayList;

/**
 *
 * @author Lucas
 */
public class BestResultFinder {

    public ArrayList<Integer> findBestResult(ArrayList<ArrayList> list) {

        ArrayList<Integer> result = new ArrayList<Integer>();
        ArrayList<Integer> current;
        int total;
        int surprising;
        int min;
        int value;

        for (int n = 0; n < list.size(); n++) {

            current = list.get(n);
            total = 0;
            surprising = current.get(1);
            min = current.get(2);

            for (int m = 0; m < current.get(0); m++) {

                value = current.get(3 + m) / 3;

                switch (current.get(3 + m) % 3) {

                    // (n, n, n) -> Regular
                    // (n - 1, n , n + 1) -> Surprising

                    case 0: {

                        if (value >= min) {
                            total++;
                        } else if ((surprising > 0) && (value > 0) && (value + 1 >= min)) {
                            total++;
                            surprising--;
                        }
                        break;
                    }
                        
                    // (n, n, n + 1) -> Regular
                    // (n - 1, n + 1, n + 1) -> Surprising
                            
                    case 1: {
                        if ((value >= min) || (value + 1 >= min)) {
                            total++;
                        } else if ((surprising > 0) && (value + 1 >= min)) {
                            total++;
                            surprising--;
                        }
                        break;
                    }
                        
                    // (n, n + 1, n + 1) -> Regular
                    // (n, n, n + 2) -> Surprising
                        
                    case 2: {
                        if ((value >= min) || (value + 1 >= min)) {
                            total++;
                        } else if ((surprising > 0) && (value + 2 >= min)) {
                            total++;
                            surprising--;
                        }
                        break;
                    }
                }
            }
            result.add(total);
        }
        return result;
    }
}
