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

public class J12QB implements Runnable {
	Scanner in;
	PrintWriter out;
	static String taskname = ".\\src\\B-large";
	int test, testn, i, j, k;
	int N,S,p;

	public static void main(String[] args) {
		new Thread(new J12QB()).start();
	}

	public void solve() throws Exception {
		testn = in.nextInt();

		for (test = 0; test < testn; test++) {
			int A=0,B=0,C=0,n; //A:must be surprise to be a candidate B: must not surprise C:candidate
			out.print("Case #" + (test + 1) + ": ");
			N = in.nextInt();
			S = in.nextInt();
			p = in.nextInt();
			for (int i = 0; i < N; i++) {
				n=in.nextInt();
				if (n==0)
					C+=(p==0)?1:0;
				else if (n>=3*p-4){
					C++;
					if (n==3*p-3 || n==3*p-4)
						A++;
				}
			}
			if(A>S)
				C-=(A-S);

			out.print(C+"\n");
		}
	}

	@Override
	public void run() {
		try {
			in = new Scanner(new File(taskname + ".in"));
			out = new PrintWriter(taskname+".out");
			//out = new PrintWriter(System.out, true);
			//			in = new BufferedReader( new InputStreamReader(System.in));
			//			out = new BufferedWriter( new OutputStreamWriter(System.out));
			solve();
			out.flush();
		} catch (Exception e) {
			e.printStackTrace();
		}
	}
}
