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

public class B{
	void solve() throws FileNotFoundException{
		File fin = new File("data.in");
		File fout = new File("data.out");
		Scanner cin = new Scanner(fin);
		PrintWriter cout = new PrintWriter(fout);
		
		int T, n, s, p;
		T = cin.nextInt();
		for(int k = 0; k < T; k++){
			n = cin.nextInt(); s = cin.nextInt(); p = cin.nextInt();
			int [] num = new int[n];
			for(int i = 0; i < n; i++)  num[i] = cin.nextInt();
			int ans = 0;
			for(int i = 0; i < n; i++){
				if(num[i]/3>=p || (num[i]%3>0 && num[i]/3+1>=p)){
					ans++;
					continue;
				}
				if(num[i]%3==2 && num[i]/3+2>=p && s>0){
					s--;
					ans++;
				}
				if(num[i]%3==0 && num[i]/3+1>=p && num[i]/3>0 && s>0){
					s--;
					ans++;
				}
			}
			cout.printf("Case #%d: %d\n", k+1, ans);
		}
		
		cout.flush();
	}
	public static void main(String [] args) throws Exception{
		B test = new B();
		test.solve();
	}
}












