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.IOException;
import java.io.InputStreamReader;
import java.util.Scanner;


public class Dancing {


	public static void main(String[] args) throws NumberFormatException, IOException {
		Scanner read = new Scanner(new InputStreamReader(System.in));
		int cases = Integer.parseInt(read.next());
		int counter =1;
		while(cases>0){
			int n = Integer.parseInt(read.next());
			int s = Integer.parseInt(read.next());
			int p = Integer.parseInt(read.next());
			int bests = 0;
			int p2 =0;
			int googler;
			for(int i=0; i<n; i++){
				 googler = Integer.parseInt(read.next());
				 int x = googler/3;
				 if(googler == 1 || googler ==2 || googler == 0 ){
					 if(googler == 1 && 1>=p)
						 bests++;
					 else if(googler == 2){
						 if(1>=p)
							 bests++;
						 else if(2 >= p && p2<s){
							 bests++;
							 p2++;
						 }
					 }else if( googler == 0 && 0>=p)
						 bests++;
				 }else{
					 if((x*3) == googler){
						 if(x>=p)
							 bests++;
						 else if((x+1)>= p && p2<s){
							 bests++;
							 p2++;
						 }
						 
					 }else if((x+x+x+1)== googler){
						 if((x+1) >= p )
							 bests++;
					 }else if((x+x+x+2) == googler){
						 if((x+1)>=p)
							 bests++;
						 else if((x+2)>=p && p2<s){
							 bests++;
							 p2++;
						 }
					 }
				 }
			}
			System.out.println("Case #"+counter+": "+bests);
			cases--;
			counter++;
		}
		

	}

}
