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

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

/**
 *
 * @author joshuahm
 */
public class codejamB {
    public static void main(String[] args) throws FileNotFoundException, IOException {
        FileReader inFile = new FileReader("B-large.in");
        Scanner in = new Scanner(inFile);
        FileWriter outFile = new FileWriter("B-large.out");
        PrintWriter out = new PrintWriter(outFile);
        int T= in.nextInt();
        for(int k=0;k<T;k++)
        {
            int N= in.nextInt();
            int S= in.nextInt();
            int p= in.nextInt();
            int[] total= new int[N];
            for(int i=0;i<N;i++)
                total[i]= in.nextInt();
            int possible=0;
            int surprising=0;
            for(int i=0;i<N;i++)
            {
                if(total[i]>3*p-3)
                    possible++;
                else if(total[i]>Math.max(3*p-5,0))
                    surprising++;
            }
            out.println("Case #"+ (k+1) +": "  + (possible + Math.min(surprising, S)));
        }
        in.close();
        out.close();
    }
}
