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.*;
import static java.lang.System.*;

public class B
{
	// non-surprising
	public static int best1(int x)
	{
		if (x%3 == 0) return x/3;
		else return x/3+1;
	}
	// surprising
	public static int best2(int x)
	{
		if (x == 0) return 0;
		return (x+1)/3+1;
	}
	public static void main(String[] args)
	{
		Scanner sc = new Scanner(in);
		int t = sc.nextInt();
		for (int c = 1; c <= t; c++)
		{
			int n = sc.nextInt();
			int s = sc.nextInt();
			int p = sc.nextInt();
			int[] arr = new int[31];
			for (int i = 0; i < n; i++) arr[sc.nextInt()]++;
			int ctr = 0;
			for (int i = 30; i >= 0; i--)
			{
				if (best1(i) >= p)
				{
					ctr += arr[i];
				}
				else
				{
					if (i > 1 && best2(i) >= p)
					{
						ctr += Math.min(s, arr[i]);
						if (s > arr[i]) s -= arr[i];
						else s = 0;
					}
				}
			}
			out.printf("Case #%d: %d\n", c, ctr);
		}
	}
}
