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

public class dancers {
	public static void main(String[] args) {
		try {
			Scanner input = new Scanner(new File("c:\\files\\B-small-attempt0.in"));
			FileWriter fw =  new FileWriter("c:\\files\\douts.txt");
			PrintWriter output = new PrintWriter(fw);
			int n = input.nextInt();
			for(int i=0;i<n;i++)
			{
				
				int noD = input.nextInt();
				int surprise = input.nextInt();
				int points = input.nextInt();
				
				int total[] = new int[noD];
				int count = 0;
				
				for(int j=0;j<noD;j++)
					total[j]=input.nextInt();
				
				for(int j=0;j<noD-1;j++)
					for(int k=j+1;k<noD;k++)
						if(total[j]<total[k])
						{
							int temp=total[j];
							total[j]=total[k];
							total[k]=temp;
						}
				
				for(int dIndex=0;dIndex<noD;dIndex++)
				{
					if(total[dIndex]>=3*points-2)
						count++;
					else if(surprise>0 && (total[dIndex]==3*points-3 || total[dIndex]==3*points-4) && total[dIndex]>0)
					{
						surprise--;
						count++;
					}
					else
						break;
				}
				output.println("Case #"+(i+1)+": "+count);
			}
			output.close();
		} catch (Exception e) {
			e.printStackTrace();
		}
	}
}
