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);
		}
	}

}

package birgit.vera.schmidt.googlecodejam2012.qual;

import java.io.BufferedReader;
import java.io.File;
import java.io.FileOutputStream;
import java.io.FileReader;
import java.io.IOException;
import java.io.PrintStream;

public class B {
  public static void main(String[] args) {
    try {
      String filename = "B-large";
      BufferedReader in = new BufferedReader(new FileReader(new File(filename + ".in")));
      PrintStream out = new PrintStream(new FileOutputStream(new File(filename + ".out")));

      int t = Integer.parseInt(in.readLine());

      for (int i = 0; i < t; i++) {
        out.println("Case #" + (i+1) + ": " + calcCase(in.readLine()));
      }

    } catch (IOException e) {
      // Just crash.
      e.printStackTrace();
    }
  }

  private static int calcCase(String line) {
    String[] parts = line.split(" ");
    int n = Integer.parseInt(parts[0]);
    int s = Integer.parseInt(parts[1]);
    int p = Integer.parseInt(parts[2]);
    int[] g = new int[n];
    for (int i = 0; i < n; i++) {
      g[i] = Integer.parseInt(parts[i+3]);
    }

    int ok = 0;
    int okWithSurprising = 0;
    int notOk = 0;

    int limitOkWithoutSurprising = 3*p-2;
    int limitOkWithSurprising = Math.max(3*p-4, 2);

    for (int score : g) {
      if (score >= limitOkWithoutSurprising) {
        ok++;
      } else if (score >= limitOkWithSurprising) {
        okWithSurprising++;
      } else {
        notOk++;
      }
    }

    return ok + Math.min(okWithSurprising, s);
  }
}
