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.security.AlgorithmConstraints;
import java.util.Scanner;
import java.util.StringTokenizer;


public class Numbers {

	static int count =0;
	static int max;
	static int surprise;
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner sc = new Scanner(System.in);
		int testCases = Integer.parseInt(sc.nextLine().trim());
		for(int i=1;i<=testCases;i++){
			String line = sc.nextLine();
			StringTokenizer st = new StringTokenizer(line);
			int persons = Integer.parseInt(st.nextToken());
			surprise = Integer.parseInt(st.nextToken());
			max = Integer.parseInt(st.nextToken());
			count =0;
			if(max == 0){
				System.out.println("Case #"+i+": "+persons);
			}else{
				for(int j=0;j<persons;j++){
					algorithm(Integer.parseInt(st.nextToken()));
				}
				System.out.println("Case #"+i+": "+count);
				}
		}

	}
	public static void algorithm(int current){
		if(current ==0){
			return;
		}
		int div = current/3;
		if(current%3==0){
			if(div >=max){
				count++;
			}else if(surprise>0 && (div+1) >=max){
				count++;
				surprise--;
			}
		}else if(current%3==1){
			if((div+1) >=max){
				count++;
			} 
		}else if(current%3==2){
			if((div+1) >=max) count++;
			else if(surprise>0 && (div+2)>=max){
				count++;
				surprise--;
			}
		}
	}

}
