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.util.*;
import java.lang.Math.*;

public class DancingWithTheGooglers {

	public static void main(String[] args) throws IOException{
		Scanner in = new Scanner(new File("DancingWithTheGooglers.in"));
	    PrintWriter p = new PrintWriter("DancingWithTheGooglers.out");
	    int t = Integer.parseInt(in.nextLine());
	    int n;
	    int s;
	    int h;
	    int q;
	    int [] d = new int[100]; 
	    for(int c = 1; c < t+1; c++){
	    	q = 0;
	    	n = Integer.parseInt(in.next());
	    	s = Integer.parseInt(in.next());
	    	h = Integer.parseInt(in.next())-1;
	    	for (int i = 0; i < n; i++){
	    		d[i] = Integer.parseInt(in.next());
	    		if(d[i] > 3*h){
	    			q++;
	    		}else if((d[i]==3*h||d[i]==3*h-1)&&s > 0&& h!= 0){
	    			q++;
	    			s--;
	    		}
	    	}
	    	p.println("Case #"+c+": "+q);
	    	if(c!=t)in.nextLine();
	    }
	    in.close();
	    p.close();
	}

}