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.IOException;
import java.util.List;

public class StoreCredit extends JamProblem {
    public static void main(String[] args) throws IOException {
        StoreCredit problem= new StoreCredit();
        problem.go();
    }

    @Override
    String solveCase(JamCase jamCase) {
        StoreCreditCase cas = (StoreCreditCase) jamCase;
        for (int i=0; i<cas.itemCount; i++) {
            for (int j=0; j<cas.itemCount; j++) {
                if (i==j) {
                    continue;
                }
                if (cas.prices[i] + cas.prices[j] == cas.credit) {
                    return "" + (i+1) + " " + (j+1);
                }
            }
        }
        throw new RuntimeException();
    }

    @Override
    JamCase parseCase(List<String> file, int line) {
        StoreCreditCase cas = new StoreCreditCase();
        String fist =  file.get(line);
        String second =  file.get(line+1);
        String third =  file.get(line+2);
        cas.credit= Integer.parseInt(fist);
        cas.lineCount = 3;
        cas.itemCount = Integer.parseInt(second);
        cas.prices = JamUtil.parseIntList(third, cas.itemCount);
        return cas;
    }
}

class StoreCreditCase extends JamCase {
    int itemCount;
    int[] prices;
    public int credit;
}
