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.util.List;
import java.util.ArrayList;

class Dancing
{
  public static void main(String... args)
  {
    Scanner sc = new Scanner(System.in);
    int tests = sc.nextInt();
    for (int test = 1; test <= tests; test++)
    {
      int n = sc.nextInt();
      int s = sc.nextInt();
      int p = sc.nextInt();
      List<Integer> scores = new ArrayList<Integer>(n);
      for (int i = 0; i < n; i++)
      {
        scores.add(sc.nextInt());
      }
      int result = solve(n, s, p, scores);
      System.out.println("Case #" + test + ": " + result);
    }
  }

  public static int solve(int n, int s, int p, List<Integer> scores)
  {
    java.util.Collections.sort(scores);
    java.util.Collections.reverse(scores);
    int result = 0;
    for (Integer score : scores)
    {
      int avg = score / 3;
      if (avg >= p)
      {
        result++;
        continue;
      }
      if (score - (avg * 3) > 0 && avg + 1 >= p)
      {
        result++;
        continue;
      }
      // need a surprising result
      if (score < 2 || score > 28)
      {
        // suprising results impossible here
        continue;
      }
      if (score - (avg * 3) == 2 && avg + 2 >= p && s > 0)
      {
        result++;
        s--;
        continue;
      }
      if (score - (avg * 3) == 0 && avg + 1 >= p && s > 0)
      {
        result++;
        s--;
        continue;
      }
    }
    return result;
  }
}
