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 br.com.feasoft.jam;

import java.io.IOException;
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;

/**
 * User: Homer
 * Date: 4/13/12
 * Time: 9:15 PM
 */
public class Dance {

    public static void main(String[] args) throws IOException {
        Scanner scanner = new Scanner(System.in);
        int numberOfCases = scanner.nextInt();

        for (int i = 0; i < numberOfCases; i++) {
            int numberOfGooglers = scanner.nextInt();
            int surprisingScore = scanner.nextInt();
            int floorScore = scanner.nextInt();

            List<Integer> scores = new ArrayList<Integer>();
            for (int j = 0; j < numberOfGooglers; j++) {
                scores.add(scanner.nextInt());
            }

            int answer = solve(surprisingScore, floorScore, scores);
            System.out.printf("Case #%d: %d\n", i + 1, answer);
        }
    }

    private static int solve(int surprisingScoresMaxQuantity, int floorScore, List<Integer> scores) {
        int surprisingFound = 0;
        int surprisingMinScore = floorScore + 2*(floorScore-2);
        int nonSurprisingMinScore = floorScore + 2*(floorScore-1);

        if (surprisingMinScore < 0) {
            surprisingMinScore = floorScore;
        }
        if (nonSurprisingMinScore < 0) {
            nonSurprisingMinScore = floorScore;
        }

        int count = 0;
        
        for (Integer totalScore : scores) {
            if (totalScore >= nonSurprisingMinScore) {
                count++;
            } else if (totalScore >= surprisingMinScore && surprisingScoresMaxQuantity > surprisingFound) {
                count++;
                surprisingFound++;
            }
        }
        return count;
    }


}
