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.*;
import java.math.*;

public class dancingGooglers {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub

		Scanner scan = new Scanner(System.in);
		int numStrings = scan.nextInt();
		
		for(int i =1; i <= numStrings; i++){
			int numGooglers = scan.nextInt();
			int numSurprises = scan.nextInt();
			int p = scan.nextInt();
			
			int[] totalScores;
			totalScores = new int[numGooglers];
			
			int withoutSurpriseCount, withSurpriseCount;
			withoutSurpriseCount = 0 ;
			withSurpriseCount = 0;
			
			for(int j = 1; j <= numGooglers; j++){
				
				totalScores[j-1] = scan.nextInt();
				
				if(totalScores[j-1] >= p + 2*Math.max(p-1, 0)){
					withoutSurpriseCount = withoutSurpriseCount + 1;
				}
				else if(totalScores[j-1] >= p + 2*Math.max(p-2,0)){
					withSurpriseCount = withSurpriseCount + 1;
				}
			}
			
			//System.out.println("\n " + numGooglers + " " + numSurprises + " " + withoutSurpriseCount + " " + withSurpriseCount);
			
			int temp1 = Math.min(withSurpriseCount, numSurprises);
			int temp2 = temp1 + withoutSurpriseCount;
			int temp3 = Math.min(numGooglers, temp2);
			
			System.out.format("Case #%d: %d\n", i, temp3);
		
		}
	}

}
