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

public class DanceJudging {
	
	public static int count(int[] totalPoints, int numSurprise, int target) {
		final int totalMin = target + ((target >= 1) ? (target - 1) : 0) * 2;
		final int surpriseTotalMin = target + ((target >= 2) ? (target - 2) : 0) * 2;
		int count = 0;
		Arrays.sort(totalPoints);
		for (int i = totalPoints.length - 1; i >= 0; i--) {
			if (totalPoints[i] >= totalMin) {
				count++;
			} else if (numSurprise > 0 && totalPoints[i] >= surpriseTotalMin) {
				numSurprise--;
				count++;
			} else {
				break;
			}
		}

		return count;
	}
	
	public static void main(String[] args) {
		final Scanner in = new Scanner(System.in);
		final int numCase = in.nextInt();
		in.nextLine();
		int numGoogler, numSurprise, target;
		int[] totalPoints;
		for (int i = 0; i < numCase; i++) {
			numGoogler = in.nextInt();
			numSurprise = in.nextInt();
			target = in.nextInt();
			totalPoints = new int[numGoogler];
			for (int j = 0; j < numGoogler; j++) {
				totalPoints[j] = in.nextInt();
			}
			System.out.println("Case #" + (i+1) + ": " + count(totalPoints, numSurprise, target));
			in.nextLine();
		}
	}
}
