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 ProblemB
{
	public static void main(String[] args)
	{
		String txtfile="B-large.in";
		try
		{
			Scanner scan = new Scanner(new FileInputStream(txtfile));
			FileWriter fstream = new FileWriter("B-large.out");
			BufferedWriter out = new BufferedWriter(fstream);
			int T = scan.nextInt();
			int N,S,p;
			int[] t ;
			int max=0;

			for (int X=1;X<=T;X++)
			{
				max = 0;
				N = scan.nextInt();
				S = scan.nextInt();
				p = scan.nextInt();
				t = new int[N];
				for (int i=0;i<N;i++)
				{
					t[i] = scan.nextInt();
				}

				Arrays.sort(t);
				int a,b;
				for (int i=N-1;i>=0;i--)
				{
					a = t[i] / 3;
					b = t[i] % 3;
					if (a>=p)
						max++;
					else if (p-a<=2)
					{
						if (b>0) a++;
						if (a<p && t[i]>0)
						{
							if (p-a==1 && b==0 && S>0)
							{
								a++;
								S--;
							}
							else if (b==2 && S>0)
							{
								a++;
								S--;
							}
						}
						if (a>=p) max++;

					}
				}
				out.write("Case #" + X + ": " + max + "\n");
			}
			out.close();
		}
		catch (Exception ex)
		{
			System.out.println(ex);
			System.exit(1);
		}

	}
}