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

public class Main {
	public static void main(String[] args) throws Exception {
		BufferedReader bf = new BufferedReader(new FileReader(new File("B-large.in")));
		BufferedWriter bw = new BufferedWriter(new FileWriter(new File("B-large.out")));

		int T = Integer.parseInt(bf.readLine());
		
		for (int c = 0; c < T; c++) {
			String tokens[] = bf.readLine().split(" ");
			int N = Integer.parseInt(tokens[0]), S = Integer.parseInt(tokens[1]), p = Integer.parseInt(tokens[2]), t[] = new int[N], ans =0;
			for (int i = 0; i < N; i++) {
				t[i] = Integer.parseInt(tokens[i + 3]);
				int base = t[i] / 3, mod = t[i] % 3;
				if (base >= p || (mod > 0 && base + 1 >= p)) 
					ans++;
				else if(S>0 && base >0 && base + Math.max(1, mod) >= p) {
					ans++;
					S--;
				}
			}
			bw.write(String.format("Case #%d: %d\n", c+1, ans));
		}
		bw.close();
	}
}
