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.util.ArrayList;
import java.util.Scanner;


public class DancingWithTheGooglers {

	public static int calculateBestResultGooglers(int N,int S,int p,ArrayList<Integer> result){
		int noofresultpossible=0,surprisingTrippletsCount=0;
		for(int i=0;i<result.size();i++){
			if((result.get(i)/3)>=p){
				noofresultpossible++;
			}else if((result.get(i)/3)+1>=p){
				if(result.get(i)%3!=0){
					noofresultpossible++;
				}else if (surprisingTrippletsCount<S && result.get(i)>=1){
					noofresultpossible++;
					surprisingTrippletsCount++;
				}
			}else if((result.get(i)/3)+2>=p){
				if(result.get(i)%3==2&&surprisingTrippletsCount<S && result.get(i)>=2){
					noofresultpossible++;
					surprisingTrippletsCount++;
				}			
			}
		}
		return noofresultpossible;
	}
	/**
	 * @param args
	 */
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int NoOfTestCases = in.nextInt();
		int noOfGooglers,noOfSurprisingTriplets,bestResultPossibilities,totalPoints;
		StringBuilder output=new StringBuilder();
		ArrayList<Integer> result=null;
		for(int i=1;i<=NoOfTestCases;i++){
			noOfGooglers=in.nextInt();
			noOfSurprisingTriplets=in.nextInt();
			bestResultPossibilities=in.nextInt();
//			System.out.println("No of Googlers : "+noOfGooglers);
//			System.out.println("No of SurprisingTriplets : "+noOfSurprisingTriplets);
//			System.out.println("Best Result of at Least p : "+bestResultPossibilities);
//			System.out.print("Total Points :");
			result=new ArrayList<Integer>();
			for(int j=1;j<=noOfGooglers;j++){
				totalPoints=in.nextInt();
//				System.out.print(" "+totalPoints);
				result.add(totalPoints);
			}
			output.append("Case #"+i+": "+calculateBestResultGooglers(noOfGooglers, noOfSurprisingTriplets, bestResultPossibilities, result)+"\n");			
		}
		System.out.println(output);
	}

}
