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 Sol2 {
	public static void main(String[] args) throws Exception {
		Scanner sc = new Scanner(new File("B-large.in"));
		System.setOut(new PrintStream(new File("B-large.out")));
		int len = sc.nextInt();
		for (int i = 0; i < len; i++) {
			int nexlen = sc.nextInt();
			int surp = sc.nextInt();
			int minscore = sc.nextInt();
			int numb = 0;
			for (int a = 0; a < nexlen; a++) {
				int[] three = separate(sc.nextInt());
				if (isGood(three, minscore)) {
					numb++;
				} else {
					if (((three[0]==three[1]&&three[1]==three[2]&&three[0]!=0)||(three[0]==three[1]&&three[1]-1==three[2]))&&surp>0) {
						if (three[0]+1>=minscore) {
							numb++;
							surp--;
						}
					}
				}
			}
			System.out.println("Case #"+(i+1)+": "+numb);
		}
	}
	public static int[] separate(int i) {
		int[] ret = new int[3];
		ret[0] = (int)Math.ceil(i/3.);
		ret[1] = (int)Math.ceil((i-ret[0])/2.);
		ret[2] = i-ret[0]-ret[1];
		return ret;
	}
	public static boolean isGood(int[] in,int a) {
		for (int i = 0; i < 3; i++) {
			if (in[i]>=a) {
				return true;
			}
		}
		return false;
	}
}