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

public class Qual2 {


	public static void main(String[] args) throws Exception {
		Scanner sc = new Scanner(new File("B-large.in"));
		FileWriter fw = new FileWriter("B-output.txt");
		int total = sc.nextInt();
		for(int i = 1; i <= total; i++) {
			int n = sc.nextInt(), s = sc.nextInt(), p = sc.nextInt();
			int[] scores = new int[n];
			for(int j = 0; j < n; j++) scores[j] = sc.nextInt();
			int count = 0;
			for(int j = 0; j < n; j++) {
				int div = scores[j] / 3, rem = scores[j] % 3;
				if(rem == 0) {
					if(div >= p) count++;
					else if(div == p-1 && div > 0 && s > 0) {
						s--;
						count++;
					}
				}
				else if(rem == 1) {
					if(div + 1 >= p) count++;
				}
				else if(rem == 2) {
					if(div + 1 >= p) count++;
					else if(div + 2 >= p && s > 0) {
						s--;
						count++;
					}
				}
			}
			fw.write("Case #" + i + ": " + count + "\n");
			System.out.println("Case #" + i + ": " + count);
		}
		fw.close();
	}

}
