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

public class B {
	public static void main(String[] args) throws IOException {
		BufferedReader in = new BufferedReader(new FileReader("B-large.in"));
		String li;
		int tcn = Integer.parseInt(in.readLine());
		Scanner sc;
		int N, S, P;
		int[] scr;
		for (int tc = 0; tc < tcn; tc++) {
			li = in.readLine();
			sc = new Scanner(li);
			N = sc.nextInt(); S = sc.nextInt(); P = sc.nextInt();
			scr = new int[N];
			for (int i = 0; i < N; i++) {
				scr[i] = sc.nextInt();
			}
			
			Arrays.sort(scr);
			
			int result = 0;
			for (int i = scr.length - 1; i >=0; i--) {
				int tmp = scr[i] / 3;
				if (P - tmp >= 3 || (scr[i] == 0 && P > 0)) break;
				int r = scr[i] % 3;
				if (tmp >= P) {
					result++;
				} else {
					if (P - tmp == 1) {
						if (r > 0) {
							result++;
						} else {
							if (S > 0) {
								result++;
								S--;
							}
						}
					} else {
						if (P -tmp == 2) {
							if (r == 2 && S > 0) {
								result++;
								S--;
							}
						}
					}
				}
			}
			
			System.out.println("Case #" + (tc + 1) + ": " + result);
		}
		in.close();
	}

}
