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

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

public class ProblemB
{
    public static void main(String[] args) throws FileNotFoundException
    {
        Scanner sc = new Scanner(new File("B-large.in"));
        sc.nextLine(); // input size
        int cases = 0;
        while(sc.hasNext())
        {
            String line = sc.nextLine();
            String[] vals = line.split(" ");
            int googlerCount = Integer.parseInt(vals[0]);
            int maxSupriseCount = Integer.parseInt(vals[1]);
            int limit = Integer.parseInt(vals[2]);
            int[] scores = new int[vals.length - 3];
            for(int i = 0; i < vals.length - 3; i++)
            {
                scores[i] = Integer.parseInt(vals[i+3]);
            }

            int output = 0;
            int supriseCount = 0;
            for(int score : scores)
            {
                if (score == 0 && limit > 0) {
                    continue;
                }
                double avg = score / 3d;
                if (avg >= limit)
                {
                    output++;
                }
                else if (limit - avg < 1) {
                    output++;
                }
                else if (limit - avg < 1.5) {
                    if (supriseCount < maxSupriseCount) {
                        supriseCount++;
                        output++;
                    }
                }
            }
            System.out.println("Case #" + ++cases + ": " + output);
            
        }
    }
}
