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.IOException;
import java.io.InputStreamReader;
public class b {	
	
	public static void main(String[] args) throws IOException {		
		BufferedReader bd= new BufferedReader(new InputStreamReader(System.in));
		int li= Integer.parseInt(bd.readLine());
		for (int i = 1; i <=li; i++) {
			String[] cadena=bd.readLine().split(" ");
			int n=Integer.parseInt(cadena[0]);
			int s=Integer.parseInt(cadena[1]);
			int p=Integer.parseInt(cadena[2]);			
			
			int min=p+(2*(p-1));						
			int mins=(p+(2*(p-2))<0)?1:(p+(2*(p-2)));		
			
			int[] c = new int[n];
			int res=0;
			for (int j = 0; j < n; j++) {
				c[j]=Integer.parseInt(cadena[3+j]);
				if(c[j]>=min){
					res++;
					//System.out.println(c[j]);
				}
				else if((c[j]>=mins)&&s>0){
					res++;
					s--;
					//System.out.println(c[j]);
				}
				
			}		
			System.out.println("Case #"+i+": "+res);					
		}		
	}
	static boolean saleConP(int t,int p){
		
		
		return false;
	}
	static boolean saleConPS(int t,int p){
		
		
		return false;
	}
}
 