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.StringTokenizer;


public class dancers {

	/**
	 * @param args
	 */
	public static void main(String[] args) throws IOException
	{
		// TODO Auto-generated method stub
		BufferedReader br = new BufferedReader(new FileReader("problem.in"));
		int t = Integer.parseInt(br.readLine());
		for (int i = 1; i <= t; i++)
		{
			String line = br.readLine();
			StringTokenizer st = new StringTokenizer(line, " ");
			int len = Integer.parseInt(st.nextToken());
			int surp = Integer.parseInt(st.nextToken());
			int want = Integer.parseInt(st.nextToken());
			int count = 0;
			int[] vals = new int[len];
			for (int j = 0; j < len; j++)
			{
				vals[j] = Integer.parseInt(st.nextToken());
			}
			for (int k: vals)
			{
				k -= want;
				if (k <0)
					continue;
				else
				{
					if (k >= 2 * want - 2)
					{
						count++;
					}
					else if (k >= 2 * want - 4)
					{
						if (surp == 0)
							continue;
						else
						{
							surp--;
							count++;
						}
					}
				}
			}
			System.out.println("Case #" + i + ": " + count);
			
		}
	}

}
