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.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.Scanner;


public class Dancing {

	public static PrintWriter pw;
	
	public static void main(String[] args) throws FileNotFoundException {
		
		//Scanner in = new Scanner (System.in);
		try{
			File f = new File("\\\\filesrv/stufiles$/matt.tough/out.txt");
			f.createNewFile();
			pw = new PrintWriter(f);
		}catch(Exception e){
			
		}
		Scanner in = new Scanner(new File("\\\\filesrv/stufiles$/matt.tough/B-large.in"));
		String line = in.nextLine();
		int cases = Integer.parseInt(line);
		for (int t=0; t < cases; t++){
			line = in.nextLine();
			Scanner thisLine = new Scanner (line);
			int dancers = thisLine.nextInt();
			int surprises = thisLine.nextInt();
			int p = thisLine.nextInt();
			int p3 = p*3;
			int count =0;
			int totalScores[] = new int[dancers];
			for (int index = 0; index < dancers; index++){
				totalScores[index] = thisLine.nextInt();
			}
			for ( int i = 0; i < dancers; i++){
				if(p ==0){
					count++;
					continue;
				}else if(p ==1){
					if (totalScores[i]>0)
						count++;
					continue;
						
				}
				
				if (totalScores[i]>= p3-2){
					count++;
				}
				else if(totalScores[i]>= p3-4){
					if (surprises>0){
						surprises--;
						count++;
					}
				}
				
			}
			pw.printf("Case #%d: %d\n", t+1, count);
		}
		pw.flush();
	}
	
}
