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.io.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.Scanner;


public class B {
	public static void main(String[] args) throws FileNotFoundException {
		Scanner read = new Scanner(new File("B-large.in"));
		PrintWriter out = new PrintWriter(new File("b-large.out"));
		int numberOfTests = Integer.parseInt(read.nextLine());
		for (int i = 1; i <= numberOfTests; i++) {
			int result = 0;
			int n = read.nextInt();
			int countSurp = read.nextInt();
			int minScore = read.nextInt();
			int[] totalScores = new int[n];
			for (int j = 0; j < n; j++) {
				totalScores[j] = read.nextInt();
			}
			double[] avg = new double[n];
			for (int j = 0; j < n; j++) {
				avg[j] = totalScores[j] / 3.0;
			}
			for (int j = 0; j < n; j++) {
				if (avg[j] >= minScore) {
					result++;
				} else if (Math.abs(avg[j] - minScore) >= 1.5) {
					continue;
				} else if (Math.abs(avg[j] - Math.round(avg[j])) < 0.3) {
					long t1 = Math.round(avg[j]);
					long t2 = t1;
					long t3 = t2;
					if (countSurp > 0 && t2 >=1) {
						t2--;
						t3++;
						countSurp--;
						result++;
					}
				} else if (avg[j] - Math.round(avg[j]) > 0) {
					long t1 = Math.round(avg[j]);
					long t2 = t1;
					long t3 = t2 + 1;
					if (t3 == minScore) {
						result++;
					}
				} else {
					long t1 = Math.round(avg[j]) - 1;
					long t2 = t1 + 1;
					long t3 = t2;
					if (t3 == minScore) {
						result++;
					} else {
						if (countSurp > 0 && t2 >= 1) {
							countSurp--;
							result++;
							t2--;
							t3++;
						}
					}
				}
			}
			out.println(String.format("Case #%d: %d", i, result));
		}
		out.close();
	}
}
