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.io.*;

public class q2 {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		File file = new File("C:/Users/Raja/workspace/GCJ/src/in.txt");
		
		
		int N,S,p;
		int[] sums;
		int norm,surp,ans;
		
		try{
			Scanner s = new Scanner(file);
			int num = Integer.parseInt(s.nextLine());
			for (int i = 0;i<num;i++){
				norm = 0;
				surp = 0;
				N = s.nextInt();
				S = s.nextInt();
				p = s.nextInt();
				sums = new int[N];
				for (int j = 0; j < N; j++){
					sums[j] = s.nextInt();
				}
				Arrays.sort(sums);
				for (int j = 0; j < N; j++){
					if (sums[j] >= 3*p-2)
						norm++;
					else if (sums[j] >= 3*p-4 && sums[j] > 1)
						surp++;
				}
				if (surp > S)
					ans = norm + S;
				else
					ans = norm + surp;
				
				System.out.println("Case #"+(i+1)+": "+ans);
			}
		}
		catch (FileNotFoundException e){
			e.printStackTrace();
		}

	}

}
