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

}

public class DancingWiththeGooglers {
	
	public static void main(String[] args) {
		//initialize();
		java.util.Scanner sc = new java.util.Scanner(System.in);
		int testCases = sc.nextInt();
		sc.nextLine();
		for(int i=0;i<testCases;i++){
			int s,p,n,upperBound,lowerBound;
			
			//int[][] triplet;
			int[] sum;
			//boolean[] processed;
			int count = 0;
			
			n = sc.nextInt();
			s = sc.nextInt();
			p = sc.nextInt();
			
			upperBound = 3*p;
			lowerBound = 3*p-5;
			if(lowerBound < 0)
				lowerBound = 0;
			sum = new int[n];
			//processed = new boolean[n];
			//triplet = new int[n][3];
			
			for(int i1=0;i1<n;i1++){
				sum[i1] = sc.nextInt();
				if(sum[i1] >= upperBound-2){ 
					count++;
					//processed[i1] = true;
				}
				else if(sum[i1] > lowerBound){
					//processed[i1] = true;
					if(s > 0){
						s--;
						count++;
					}		
				}
			}
			
			StringBuffer sb = new StringBuffer("Case #");
			sb.append(i+1);
			sb.append(": ");
			
			sb.append(count);
			System.out.println(sb);
		}
	}
	
}