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.FileInputStream;
import java.io.FileOutputStream;
import java.io.PrintStream;
import java.util.Arrays;
import java.util.Scanner;

public class ProblemB {
	public static void main(String[] args) throws Exception {

		Scanner in = new Scanner(
		// System.in
		// new FileInputStream("b-small.in")
				new FileInputStream("b-large.in"));
		PrintStream out = new PrintStream(
		// System.out
		// new FileOutputStream("b-small.out")
				new FileOutputStream("b-large.out"));
		int T = in.nextInt();
		in.nextLine();

		for (int i = 1; i <= T; i++) {
			int res = 0;
			int N = in.nextInt();
			int S = in.nextInt();
			int p = in.nextInt();
			int[] ts = new int[N];
			for (int j = 0; j < N; j++)
				ts[j] = in.nextInt();
			in.nextLine();
			Arrays.sort(ts);

			int nscore = Math.max(p * 3 - 2, p);
			int sscore = Math.max(p * 3 - 4, p);

			for (int j = N; --j >= 0;) {
				if (ts[j] >= nscore)
					res++;
				else if (ts[j] >= sscore && S-- > 0)
					res++;
				else
					break;
			}
			out.println("Case #" + i + ": " + res);
		}
	}
}
