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 qualificationRound;

import java.io.BufferedOutputStream;
import java.io.File;
import java.io.FileOutputStream;
import java.util.Scanner;


public class B {

	public static void main(String[] args) throws Exception {
		Scanner sc = new Scanner(System.in);

		int ncases = sc.nextInt();

		StringBuilder sb = new StringBuilder();
		for ( int ncase = 1; ncase <= ncases; ncase++ ) {
			int nGooglers = sc.nextInt();
			int nSuprising = sc.nextInt();
			int p = sc.nextInt();
			int surprises = 0;
			int count = 0;
			for (int i = 0; i < nGooglers; i++) {
				int s = sc.nextInt();
				int q = s/3;
				int rm = s%3;
				int pq = p-q;
				
				if ( s < p)
					continue;

				if ( q >= p  ) {
					count++;
				}
				else if ( pq <= 2 ){
					if ( rm == 0 ) {
						if ( pq == 1 && surprises < nSuprising ) {
							count++;
							surprises++;
						}
					}
					else {
						if ( pq == 1 )
							count++;
						else if ( rm == 2 && surprises < nSuprising ) {
							count++;
							surprises++;
						}
					}
				}
			}

			sb.append("Case #"+ ncase +": " + count +  "\n");
		}

		BufferedOutputStream bos = null;
		bos= new BufferedOutputStream(new FileOutputStream(new File("C:\\Users\\Christian\\workspaceCPDI\\CodeJam2012\\src\\qualificationRound\\res.txt")));
		bos.write(sb.toString().getBytes());
		bos.close();
	}
	
}