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.FileReader;
import java.util.LinkedList;
import java.util.StringTokenizer;


public class GoogleDance {
	
	public static void main(String args[]) throws Exception{
		String line = "";
		BufferedReader br =	new BufferedReader(new FileReader("/Users/ravipalacherla/Documents/workspace/CodeJam/src/input.txt"));
		int T = Integer.parseInt(br.readLine());
		int answer = 0, j =0;
		while((line = br.readLine()) != null) {
			StringTokenizer st = new StringTokenizer(line," ");
			while(st.hasMoreTokens()) {
				int N = Integer.parseInt(st.nextToken());
				int S = Integer.parseInt(st.nextToken());
				int p = Integer.parseInt(st.nextToken());
				int usedS = 0;
				int result = 0;
				//LinkedList<Integer> totalPoints = new LinkedList<Integer>();
				for(int i =0;i<N;i++) {
					//totalPoints.add(Integer.parseInt(st.nextToken()));
					int totalPoint = Integer.parseInt(st.nextToken());
					if(totalPoint < p) {
						continue;
					}
					if(p <= 0) {
						result++;
						continue;
					}
					if(totalPoint >= p+(2*(p-1))) {
						result++;
					} else if ( totalPoint >= p+(2*(p-2)) && totalPoint < p+(2*(p-1)) && usedS < S) {
						usedS++;
						result++;
					}
				}
				j++;
				System.out.println("Case #"+ j +": "+result);
			}
		}
		
	}

}
