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.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.Scanner;


public class B {

	static Scanner reader;
	static BufferedWriter writer;	

	static int countS;
	static int S;
	static int P;
	static int N;
	static int result;

	public static void verifiyTriple(int pi) {
		int div = pi/3;
		int mod = pi%3;
		int dif = P - pi/3;

		if (div >= P) {
			result++;
		} else if (dif <= 2){
			if (mod == 0) {
				if (countS < S && dif == 1) {
					countS++;
					result++;
				}
			}
		} else {
			if (dif==1) {
				result++;
			} else if ( mod == 2 && countS < S ) {
				countS++;
				result++;
			}
		}
	}


	public static void main(String[] args) throws IOException {
		reader = new Scanner(new FileReader("in.txt"));
		writer = new BufferedWriter(new FileWriter("out.txt"));

		int nt = reader.nextInt();
		for(int i = 1; i <= nt; i++) {
			result = 0;
			N = reader.nextInt();
			S = reader.nextInt();
			P = reader.nextInt();
			countS = 0;
			for (int j = 0; j < N; j++) {
				int pi = reader.nextInt();
				int div = pi/3;
				int mod = pi%3;
				int dif = P - div;

				if (pi < P)
					continue;

				if (div >= P) {
					result++;
				} else if (dif <= 2){
					if (mod == 0) {
						if (countS < S && dif == 1) {
							countS++;
							result++;
						}
					} else {
						if (dif==1) {
							result++;
						} else if ( mod == 2 && countS < S ) {
							countS++;
							result++;
						}
					}

				}
			}

			writer.write("Case #" + i + ": " + result);
			if (i < nt)
				writer.newLine();
		}
		writer.close();
	}

}
