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.FileWriter;
import java.util.Scanner;


public class B {

	
	public static void main(String[] args) throws Exception {
		Scanner sc = new Scanner(new File("B-large.in"));
		FileWriter f = new FileWriter("B.out");
		int N,S,p;
		int googler;
		int kol,ost;
		int br;
		int T=sc.nextInt();
		
		for(int t=1;t<=T;t++){
			br=0;
			sc.nextLine();
			N=sc.nextInt();
			S=sc.nextInt();
			p=sc.nextInt();
			for(int i=0;i<N;i++){
				googler=sc.nextInt();
				kol=googler/3;
				ost=googler%3;
				
				if(kol>=p){
					br++;
					continue;
				}
				
				if(ost==0){
					if(kol+1>=p&&S>0&&kol-1>=0){
						S--;
						br++;
						
					}
					continue;
				}
				
				if(ost==1){
					if(kol+1>=p){
						br++;
						
					}
					continue;
				}
				//ost==2
				if(kol+1>=p){
					br++;
					continue;
				}
				if(kol+2>=p&&S>0){
					S--;
					br++;
				}
			}
			f.write("Case #"+t+": "+br+"\n");
		}
		
		f.close();
	}

}
