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.BufferedWriter;
import java.io.File;
import java.io.FileWriter;
import java.util.Arrays;
import java.util.Scanner;
import java.util.logging.Level;
import java.util.logging.Logger;


public class QB {
    public static void main(String[] args){
        try{
            Scanner sc = new Scanner(new File("B-large.in"));    
            BufferedWriter bw = new BufferedWriter(new FileWriter(new File("output.out"))); 

            int t = sc.nextInt();
            for(int i=0;i<t;i++){
                int n = sc.nextInt();
                int s = sc.nextInt();
                int p = sc.nextInt();
                int[] scores = new int[n];
                for(int j=0;j<n;j++) scores[j] = sc.nextInt();
                Arrays.sort(scores);
                int r = 0;
                for(int j=n-1;j>=0;j--){
                    int k = scores[j]%3;
                    int m = scores[j]/3;
                    if(scores[j]==0) s = 0;
                    if(k==0){
                        if(m>=p) r += 1;
                        else if ((m+1>=p)&&(s>0)){
                            r += 1;
                            s -= 1;
                        }
                        else break;
                    }else if(k==1){
                        if(m+1>=p) r += 1;
                        else break;
                    }else{
                        if(m+1>=p) r += 1;
                        else if ((m+2>=p)&&(s>0)){
                            r += 1;
                            s -= 1;
                        }
                        else break;
                    }
                }
                bw.write("Case #"+String.valueOf(i+1)+": ");
                bw.write(String.valueOf(r));
                bw.newLine();
                bw.flush();
            }
            bw.close();

        } catch (Exception ex) {
            Logger.getLogger(QA.class.getName()).log(Level.SEVERE, null, ex);
        }
    }
}
