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);
		}
	}

}

package qualification_2012;

import java.io.PrintWriter;
import java.util.Scanner;

public class PB {
	static Scanner sc = new Scanner(System.in);
	static PrintWriter pw = new PrintWriter(System.out);

	public static void main(String[] args) {
		int t = sc.nextInt();
		for (int i = 1; i <= t; i++) {
			int n = sc.nextInt();
			int s = sc.nextInt();
			int p = sc.nextInt();
			int[][] d1 = new int[n + 1][s + 1];
			int[][] d2 = new int[n + 1][s + 1];

			for (int j = 1; j <= n; j++) {
				int x = sc.nextInt();

				for (int k = 0; k <= Math.min(s, j); k++) {
					if (k != 0)
						d1[j][k] = Math.max(d1[j - 1][k - 1], d2[j - 1][k - 1])
								+ (check(x, p, true) ? 1 : 0);
					if (k < j)
						d2[j][k] = Math.max(d2[j - 1][k], d1[j - 1][k])
								+ (check(x, p, false) ? 1 : 0);
				}
			}
			pw.println("Case #" + i + ": " + Math.max(d1[n][s], d2[n][s]));
		}
		pw.flush();
	}

	static boolean check(int a, int p, boolean surprised) {

		if (surprised) {
			switch (a % 3) {
			case 0:
				return (a > 0 && a < 28 && ((a + 3) / 3) >= p);
			case 1:
				return (a > 1 && a < 29 && ((a + 2) / 3) >= p);
			case 2:
				return (a < 27 && ((a + 4) / 3) >= p);
			}
		} else {
			switch (a % 3) {
			case 0:
				return (a / 3) >= p;
			case 1:
				return ((a + 2) / 3) >= p;
			case 2:
				return ((a + 1) / 3) >= p;
			}
		}
		return false;
	}
}
