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.Scanner;
import java.io.*;
public class Q2 {
  public static void main(String[] args) throws IOException {
    Scanner w = new Scanner(new File("D:/sample.txt"));
    int cases = Integer.parseInt(w.nextLine());
    for (int i = 0; i < cases; i++) {
      int count = 0;
      int n = w.nextInt();
      int s = w.nextInt();
      int p = w.nextInt();
      for (int j = 0; j < n; j++) {
        int total = w.nextInt();
        int k = total / 3;
        int r = total % 3;
        if (total == 0) {
          if (0 >= p) count++;
        }
        else if(r==0){
          if(k>=p)count++;
          else if(s>0&&k+1>=p){
            s--;
            count++;
          }
        }
        else if(r==1){
          if(k+1>=p)count++;
        }
        else if(r==2){
          if(k+1>=p)count++;
          else if(s>0&&k+2>=p){
            s--;
            count++;
          }
        }
      }
    System.out.println("Case #" + (i + 1) + ": " + count);
    }
  }    
}