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

public class BSmall {
	public static void get() {
		try {
			File inputFile = new File("B-large.in");
			inputFile.createNewFile();
			Scanner scan = new Scanner(inputFile);
			int t = Integer.parseInt(scan.nextLine());
			File out = new File("out.txt");
			FileWriter fw = new FileWriter(out);
			for (int i = 0; i < t - 1; i++) {
				fw.append("Case #" + (i + 1) + ": ");
				int counter = 0;
				int n = scan.nextInt();
				int s = scan.nextInt();
				int p = scan.nextInt();

				for (int j = 0; j < n; j++) {
					int g1 = scan.nextInt();
					if (g1 == 0 && p > 0) {
						continue;
					}

					if (p > 0) {
						int key = g1 / p;

						if (key >= 3) {
							counter++;
						} else {
							if (key == 2) {
								int talet = p + (g1 % p);
								int v = talet / 2;
								if (p - v == 1) {
									counter++;
								} else {
									if (p - v == 2 && s > 0) {
										counter++;
										s--;
									}
								}
							} else {
								int x = g1 - p;
								x = x / 2;
								if (p - x == 1) {
									counter++;
								} else {
									if (p - x == 2 && s > 0) {
										s--;
										counter++;
									}

								}
							}

						}
					} else {
						counter++;
					}

				}
				fw.append("" + counter + "\n");
			}

			fw.append("Case #" + (t) + ": ");
			int counter = 0;
			int n = scan.nextInt();
			int s = scan.nextInt();
			int p = scan.nextInt();

			for (int j = 0; j < n; j++) {
				int g1 = scan.nextInt();
				if (p > 0) {
					int key = g1 / p;

					if (key >= 3) {
						counter++;
					} else {
						if (key == 2) {
							int talet = p + g1 % p;
							int v = talet / 2;
							if (p - v == 1) {
								counter++;
							} else {
								if (p - v == 2 && s > 0) {
									counter++;
									s--;
								}
							}
						}

					}
				} else {
					counter++;
				}
			}
			fw.append("" + counter);
			fw.close();

		} catch (Exception e) {

		}
	}

	public static void main(String[] args) {
		get();
	}

}
