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.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;

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

/**
 *
 * @author sony
 */

public class DancingGooglers {
    public static void main(String[] args) throws FileNotFoundException, IOException
    {
     BufferedReader br=new BufferedReader(new FileReader(args[0]));
  
  int Testcases=Integer.parseInt(br.readLine());
    for(int i=0;i<Testcases;i++)
    {
    String[] line=br.readLine().split(" ");
    int N=Integer.parseInt(line[0]);
    int S=Integer.parseInt(line[1]);
    int p=Integer.parseInt(line[2]);
    int count=0;
    //System.out.print("N="+N+"S="+S+"p="+p+"\n");
    int indicator=0;
    for(int j=0;j<N;j++)
    {
    int reminder=Integer.parseInt(line[3+j])%3;
    int quotient=Integer.parseInt(line[3+j])/3;
    int sum=Integer.parseInt(line[3+j]);
    
    if(reminder==0)
    indicator++;
    
    if((quotient>=p)||(reminder==1&&quotient+1==p)||(reminder==2&&quotient+1==p))
        count++;
    else if(S>0&&sum>=p){
    
    if((reminder==0&&quotient+1==p)||(reminder==2&&quotient+2==p))    
    {
        S--;
        count++;
    }
        
    }
    
    
    }
    
    System.out.print("Case #"+(i+1)+": "+count+"\n");
    
    
    
    }
    
    }
    
}

