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 dom.zar.jam.qualifications;

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

public class DancingWithTheGooglers {

	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int inputLines = in.nextInt();
		for (int i = 0; i < inputLines;) {
			int googlersAmount = in.nextInt();
			int suprising = in.nextInt();
			int minPoints = in.nextInt();
			
			final int[] googlers = new int[googlersAmount];
			for (int k = 0; k < googlersAmount; ++k) {
				googlers[k] = in.nextInt();
			}
			
			System.out.println("Case #" + ++i + ": "
					+ result(suprising, minPoints, googlers));
		}
	}
	
	private static int result(int suprising, int minPoints,
			int[] googlers) {
		
		final List<Integer> filtered = new ArrayList<Integer>();
		for (int points : googlers) {
			boolean hasMin = (points / 3) >= minPoints;
			boolean oneLessThanMin 
				= ((points - minPoints) >> 1) == (minPoints - 1); 					
			
			if (!(hasMin || oneLessThanMin)) {
				filtered.add(points);
			}
		}
		
		int probable = 0;
		for (Integer points : filtered) {
			if (points - minPoints < 0) continue;
			int restPoints = (points - minPoints) >> 1; 
			if (Math.abs(restPoints - minPoints) <= 2) 
				probable++;
		}
		probable = Math.min(probable, suprising);
		
		return googlers.length - filtered.size() + probable;
	}
}
