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 codejam2012;

import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.HashMap;
import java.util.Scanner;

/**
 * Created by IntelliJ IDEA.
 * User: Jimmy
 * Date: 4/14/12
 * Time: 10:17 PM
 */
public class DancingWithTheGooglers implements Runnable {

    Scanner scanner;
    PrintWriter pw;

    public static void main(String arguments[]) {
        new Thread(new DancingWithTheGooglers()).start();
    }

    public static boolean isSurprising(int points) {
        return points > 1 && points < 29;
    }

    public static int ms(int points) {
        return (points + 4) / 3;
    }

    public static int mn(int points) {
        return (points + 2) / 3;
    }

    public void solution() {
        int t = scanner.nextInt();

        int i, n, s, p, j;
        int points;
        int d;
        int r = 0;
        int result;
        for(i = 1; i <= t; i++) {
            n = scanner.nextInt();
            s = scanner.nextInt();
            p = scanner.nextInt();

            System.out.println(n + " " + s + " " + p);

            int sum1 = 0;
            int sum2 = 0;

            for(j = 0; j < n; j++) {
                r = 0;
                points = scanner.nextInt();
                if(isSurprising(points)) {
                    int ms = ms(points);
                    int mn = mn(points);

                    if (ms >= p && mn < p)
                        sum1++;

                    else if (mn >= p)
                        sum2++;
                } else {
                    if (mn(points) >= p)
                        sum2++;
                }
            }
            System.out.println("******************************************************");
            pw.println("Case #" + i + ": " + (Math.min(s, sum1) + sum2));
        }
    }

    public void run() {
        scanner = new Scanner(System.in);
        try {
            pw = new PrintWriter(new File("output.txt"));
        } catch (FileNotFoundException e) {
            e.printStackTrace();
        }

        solution();

        pw.close();
        scanner.close();
    }
}
