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)throws Exception
  {
    String inputfilename = args[0];
    String outputfilename = args[1];
    BufferedReader br = new BufferedReader(new FileReader(inputfilename));
    BufferedWriter bw = new BufferedWriter(new FileWriter(outputfilename));
    int cases = Integer.valueOf(br.readLine());
    for(int i = 0; i < cases; i++) {
		String[] ele = br.readLine().split(" ");
		int n = Integer.valueOf(ele[0]);
		int s = Integer.valueOf(ele[1]);
		int p = Integer.valueOf(ele[2]);
		List<Integer> total = new ArrayList<Integer>();
		for(int j = 0; j < n; j++) {
			total.add(Integer.valueOf(ele[3 + j]));
		}
		int result = B.solve(n,s,p,total);
		bw.write("Case #" + (i + 1) + ": " + result + "\n");
    }

    
    br.close();
    bw.close();
  }
  public static int solve(int n,int s,int p,List<Integer> total)
  {
    int cnt = 0;
    for(Integer t : total) {
      int divide = t / 3;
      int left = t - divide * 3;
      if(divide >= p) {
		cnt++;
		continue;
      }
      if(left == 1) {
		if(divide + 1 >= p) cnt++;
      } else if(left == 2) {
		if(divide + 1 >= p) cnt++;
		else if(divide + 2 >= p && s > 0) {cnt++;s--;}
      } else if(divide > 0){
		if(divide + 1 >= p && s > 0) {cnt++;s--;}
      }
      
    }
    return cnt;
  }
}
