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.FileReader;
import java.io.FileWriter;
import java.io.PrintWriter;
import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        try {
            Scanner in = new Scanner(new FileReader("in.txt"));
            PrintWriter out = new PrintWriter(new FileWriter("out.txt"), true);

            int t = in.nextInt();

            for (int i = 1; i <= t; i++) {
                int res = 0;
                int n = in.nextInt();
                int s = in.nextInt();
                int p = in.nextInt();
                int tt[] = new int[n];
                for (int j = 0; j < n; j++) {
                    tt[j] = in.nextInt();
                }
                if (p == 0) {
                    res = n;
                } else {
                    int min = 3 * p - 2;
                    for (int j = 0; j < n; j++) {
                        if (min <= tt[j]) res++;
                    }
                    int ttt[] = new int[n - res];
                    int itr = 0;
                    for (int j = 0; j < n; j++) {
                        if (min > tt[j]) ttt[itr++] = tt[j];
                    }
                    int minCrazy = 3 * p - 5;
                    int ress = 0;
                    for (int j = 0; j < itr; j++) {
                        if (minCrazy <= ttt[j] && ttt[j] != 0) ress++;
                    }
                    if (ress <= s) {
                        res += ress;
                    } else {
                        res += s;
                    }
                }

                out.println("Case #" + i + ": " + res);
            }
        } catch (Exception e) {
            e.printStackTrace();
        }
    }
}