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);
		}
	}

}

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

package codejam2;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;

/**
 *
 * @author Albatross
 */
public class Main {

    
    public static void main(String[] args) throws FileNotFoundException, IOException {

        String final_output="";

        try{
            FileReader input = new FileReader("Input.txt");
            BufferedReader bufRead = new BufferedReader(input);
            String line;
            line = bufRead.readLine();
            int testCases = Integer.parseInt(line);

            
            for (int i=0; i<testCases; i++)
            {
                line = bufRead.readLine();
                String[] numbers = line.split(" ");
                int Googlers = Integer.parseInt(numbers[0]);
                int Surprising = Integer.parseInt(numbers[1]);
                int Limit = Integer.parseInt(numbers[2]);

                int[] GooglerPoints = new int[Googlers];

                for (int j=0; j<Googlers; j++)
                {
                    GooglerPoints[j] = Integer.parseInt(numbers[3+j]);
                }

                int LimitPass = 0;

                for (int x : GooglerPoints)
                {
                    double minNum = Math.floor(x/3);
                    double remPts = x - (3*minNum);
                    if (minNum>=Limit)
                        LimitPass++;
                    else if (remPts!=0 && minNum+1>=Limit)
                        LimitPass++;
                    else if (Surprising!=0)
                    {
                        if(remPts==2 && minNum+2>=Limit){
                            LimitPass++;
                            Surprising--;
                        }
                        else if(remPts==0 && minNum+1>=Limit && minNum!=0){
                            LimitPass++;
                            Surprising--;
                        }
                    }
                }
                final_output = final_output+"Case #"+(i+1)+": "+LimitPass+"\n";

            }
            bufRead.close();
        }
        finally{

        }

        FileWriter output_file = new FileWriter("Output.txt");
        BufferedWriter bufWrite = new BufferedWriter(output_file);
        try{

            bufWrite.write(final_output);
        }
        finally{
            bufWrite.close();
        }

    }

}
