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);
		}
	}

}

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

package codejam2012;

import java.util.Scanner;

/**
 *
 * @author Kumudu
 */
public class Main {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
        // TODO code application logic here
        String out="";
        Scanner in = new Scanner(System.in);
        String read = in.nextLine();
        int N = Integer.valueOf(read);
        for (int i = 0; i < N; i++) {
            read = in.nextLine();
            String [] str_vals = read.split(" ");
            int sup = Integer.valueOf(str_vals[1]);
            int min = Integer.valueOf(str_vals[2]);
            int min_tot = 3*min - 4;
            if(min<=1){
                min_tot = min;
            }
            int both=0;
            int non_sup=0;
            for (int j = 3; j < str_vals.length; j++) {
                if(Integer.valueOf(str_vals[j]) >= min_tot){
                    both++;
                }
                if(Integer.valueOf(str_vals[j]) >= (min_tot+2)){
                    non_sup++;
                }
            }
            if(min>=2){
                System.out.println("Case #"+(i+1)+": "+(non_sup  + Math.min(sup, (both-non_sup))));
            }
            if(min<=1){
                //System.out.println("ddr");
                System.out.println("Case #"+(i+1)+": "+both);
            }
        }
            
    }

}
