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.*;
import java.io.*;

public class b {
  
  public static void main (String[] args){
    
    //settingup input and output
    Scanner in = null;
    PrintWriter out = null;
    try{
      in = new Scanner(new File("blarge.txt"));
      out = new PrintWriter(new FileOutputStream("blargeout.txt"), true);
    }catch(Exception e){
      System.out.println("file not found");
    }
    
    // number of cases
    int n = in.nextInt(); 
    in.nextLine();
    
    // run through each case
    for(int currentCase = 1; currentCase <= n; currentCase++){
      
      int result = 0;
      int N = in.nextInt(); // number of Googlers
      int S = in.nextInt(); // number of surprising triplets
      int p = in.nextInt(); // must be >= p to be considered
      int t[] = new int[N]; // total point for each Googler
      for(int i = 0; i < N; i++){
        t[i] = in.nextInt();
      }
      
      for(int i = 0; i < N; i++){
        if(t[i] >= (p*3 - 2)) result++; // automatically pass
        else if((S > 0) && ((((p*3 - 3) > 0) && (t[i] == (p*3 - 3)))  
                              || (((p*3 - 4) > 0) && (t[i] == (p*3 - 4))))){
          result++;
          S--; // consumes a quota of surprising triplet to pass
        }
      }
      
      //output answers for each case
      out.println("Case #" + currentCase + ": " + result);
    }
    
    // close input and output streams
    in.close();
    out.close();
  } 
}