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

public class Dance
{
    public static void main(String args[])
    {
        Scanner input = new Scanner(System.in);
        int numCase;
        numCase = input.nextInt();
        for(int n=0; n<numCase; n++)
        {
            int numGoog, surprising, min, maxAboveMin;
            maxAboveMin = 0;

            numGoog = input.nextInt();
            surprising = input.nextInt();
            min = input.nextInt();

            int[] scores = new int[numGoog];
            int[] bestIfS = new int[numGoog];
            int[] bestIfNS = new int[numGoog];
            for(int i=0; i<numGoog; i++)
            {
                scores[i] = input.nextInt();
                if(scores[i]>0)
                {
                    bestIfS[i] = (int)((double)scores[i]/3+1.5);
                    bestIfNS[i] = (int)((double)scores[i]/3+0.7); // Rounding
                } else {
                    bestIfS[i] = 0;
                    bestIfNS[i] = 0;
                }

                /*
                 *System.out.printf("S:%d !:%d N:%d\n",scores[i]
                 *                                     bestIfS[i],
                 *                                     bestIfNS[i]);
                 */
            }

            for(int i=0; i<numGoog; i++)
            {
                if(bestIfNS[i]>=min) { maxAboveMin++; }
                else if (surprising>0 && bestIfS[i]>=min)
                {
                    maxAboveMin++;
                    surprising--;
                }
            }

            System.out.printf("Case #%d: %d\n",n+1,maxAboveMin);

        }
    }
}
