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

public class Dancing_With_the_Googlers {
	public static void main(String[] args) {
		Scanner scanner = new Scanner(System.in);
		int T = 0;
		while (scanner.hasNextInt()) {
			T = scanner.nextInt();
			break;
		}

		for (int t = 0; t <= T; t++) {
			if (scanner.hasNextLine()) {
				String line = scanner.nextLine();
				if (!line.isEmpty()) {
					String[] g = line.split(" ");
					int N = Integer.parseInt(g[0]);
					int s = Integer.parseInt(g[1]);
					int p = Integer.parseInt(g[2]);

					int minS = p + (p - 2) + (p - 2);
					int noS = p + (p - 2) + (p - 2) + 2;

					int output = 0;
					int total = 0;

					for (int i = 3; i <= N + 2; i++) {
						if (Integer.parseInt(g[i]) >= noS) {
							output++;
						} else if (Integer.parseInt(g[i]) < noS && Integer.parseInt(g[i]) >= minS) {
							if(Integer.parseInt(g[i])==0){
								continue;
							}
							total++;
						}
					}
					if (total == s) {
						output += total;
					} 
					else if(s==0){
						
					}else if (total >=s) {
						if(output==0)
							output=s;
						else
							output += (total - s);
					}else if (total <s) {
						output += total;
					}
					System.out.println("Case #" + (t) + ": " + output);
				}
			}
		}

	}

}
