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;

public class DancinWithGooglers {

    public static void main(String[] args) {
        try {
            Scanner input = new Scanner(new File("input.txt"));
            PrintStream output = new PrintStream(new FileOutputStream("output.txt"));
            solveTask(input, output);
        } catch (FileNotFoundException e) {
            System.out.println("input.txt not found");
        } catch (IOException e) {
            e.printStackTrace();
        }

    }

    private static void solveTask(Scanner input, PrintStream output) {

        int testsCount = input.nextInt();

        for (int test=1; test<=testsCount; test++) {

            int dancersCount = input.nextInt();
            int surprises = input.nextInt();
            int bestResult = input.nextInt();
            int scoreNeeded = bestResult*3-2;

            int gotResultAnywayCount = 0;
            int gotResultConditionallyCount = 0;

            for (int i=0; i<dancersCount; i++) {
                int score = input.nextInt();

                if (score >= scoreNeeded) {
                    gotResultAnywayCount++;
                } else if (score > 1 && score < 29 && score >= scoreNeeded-2) {
                    gotResultConditionallyCount++;
                }
            }

            int total = gotResultAnywayCount + Math.min(gotResultConditionallyCount, surprises);

            System.out.print("Case #"+test+": ");
            System.out.println(total);
            output.print("Case #"+test+": ");
            output.println(total);
        }
    }

}
