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

import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.util.Scanner;

public class Dancing {

	public static void main(String args[]) {
		try {
			System.setIn(new FileInputStream("B-large.in"));
			Scanner scanner = new Scanner(System.in);

			int testCases = scanner.nextInt();
			scanner.nextLine();

			for (int i = 1; i <= testCases; i++) {
				int numGooglers = scanner.nextInt();
				int numSurprising = scanner.nextInt();
				int bestResultThreshold = scanner.nextInt();

				int[] googlers = new int[numGooglers];
				for (int j = 0; j < numGooglers; j++) {
					googlers[j] = scanner.nextInt();
				}

				int passingGooglers = dancingWithTheGooglers(numGooglers,
						numSurprising, bestResultThreshold, googlers);
				System.out.println(String.format("Case #%d: %d", i,
						passingGooglers));
			}
		} catch (FileNotFoundException e) {
			e.printStackTrace();
		}
	}

	private static int dancingWithTheGooglers(int numGooglers,
			int numSurprising, int bestResultThreshold, int[] googlers) {
		int passingGooglers = 0;

		for (int i = 0; i < numGooglers; i++) {
			if (googlers[i] / 3.0 > bestResultThreshold - 1) {
				// in the case of say, [30,29,28,27,26,25], they can all meet
				// a threshold of 9 without being 'surprising'
				passingGooglers++;
			} else if (numSurprising > 0
					&& bestResultThreshold > 1
					&& googlers[i] >= ((bestResultThreshold - 1) * 3) - 1) {
				// boundary cases are when the threshold is 1 or less - in that
				// case, any non zero score would work here.
				passingGooglers++;
				numSurprising--;
			}
		}

		return passingGooglers;
	}

}
