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.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Scanner;

class Dancing {

    public static void main(String args[]) throws IOException {
        Scanner in = new Scanner(new File("dance.txt"));
        PrintWriter fw = new PrintWriter(new FileWriter(new File("dance.out")));
        int cases = in.nextInt();
        for (int c = 1; c <= cases; c++) {
            int N = in.nextInt(); // number of googlers
            int S = in.nextInt(); // number of surprising triplets
            int p = in.nextInt(); // best result
            ArrayList<Integer> scores = new ArrayList<Integer>();
            for (int n = 0; n < N; n++) {
                int googler = in.nextInt();
                scores.add(googler);
            }
            Collections.sort(scores);
            int pass = 0;
            for (int i = 0; i < scores.size(); i++) {
                int score = scores.get(i);
                int mod = score % 3;
                int max = score / 3;
                int low = max;
                if (mod > 0) {
                    max++;
                }
                if (max >= p) {
                    pass++;
                    continue;
                }
                if (S > 0) {
                    if (mod % 2 == 0) {
                        if(mod == 0 && low == 0){
                            continue;
                        }
                        max++;
                        if (max >= p) {
                            pass++;
                            S--;
                            continue;
                        }
                    }
                }

            }// for loop
            String fwout = "Case #" + c + ": " + pass;
            fw.println(fwout);
        }
        fw.close();
    }
}
