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.File;
import java.io.FileNotFoundException;
import java.io.PrintStream;
import java.util.Scanner;

public class B {
	public static void main(String[] args) throws FileNotFoundException {
		Scanner scan = new Scanner(new File("B-large.in"));
		System.setOut(new PrintStream("B-large.out"));

		int t = scan.nextInt();
		for (int c = 0; c < t; c++) {
			int n = scan.nextInt(); // num
			int s = scan.nextInt(); // surprising
			int p = scan.nextInt(); // best result cutoff
			int[] totalPoints = new int[n];
			for (int i = 0; i < n; i++)
				totalPoints[i] = scan.nextInt();

			int sUsed = 0;
			int ans = 0;
			for (int i = 0; i < n; i++) {
				int pts = totalPoints[i];
				// can it be done normal?
				if (pts >= p + (p - 1) * 2)
					ans++;
				// can it be done surp?
				else if (pts >= p + Math.max(p - 2, 0) * 2)
					if (sUsed < s) {
						ans++;
						sUsed++;
					}
			}

			System.out.printf("Case #%d: %d%n", c + 1, ans);
		}
	}
}