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.FileWriter;
import java.io.IOException;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Scanner;

public class Main {
	
	public static void main(String[] args) throws IOException {
		String file = "B-large";
		File inputFile = new File("C:\\Users\\Harutsedo\\Workspace\\Google Code Jam\\input\\2012\\QR\\" + file + ".in");
		File outputFile = new File("C:\\Users\\Harutsedo\\Workspace\\Google Code Jam\\output\\2012\\QR\\" + file + ".out");
		outputFile.createNewFile();
		Scanner scanner = new Scanner(inputFile);
		FileWriter writer = new FileWriter(outputFile);
		
		int T = scanner.nextInt();

		for (int c = 0; c < T; c++) {
			int N = scanner.nextInt();
			int S = scanner.nextInt();
			int p = scanner.nextInt();
			
			int[] scores = new int[N];
			for (int i = 0; i < N; i++) {
				scores[i] = scanner.nextInt();
			}
							
			String solution = solveCase(S, p, scores);
				
			StringBuffer s = new StringBuffer("Case #" + (c + 1) + ":");
			System.out.println(s + " " + solution);
			writer.write(s +  " " + solution);
			//if (c != N - 1) {
				writer.write("\n");
			//}
			
		}
		writer.close();
	}
	
	public static String solveCase(int S, int p, int[] scores) {
		int max = 0;
		for (int i = 0; i < scores.length; i++) {
			if ((scores[i] - p) >= 2 * p || ((scores[i] - p) >= 2 * p - 2 && p >= 1)) {
				max++;
			} else if ((scores[i] - p) >= 2 * p - 4 && S > 0 && p >= 2) {
				max++;
				S--;
			}
		}
		return String.valueOf(max);
	}

}
