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 contests.GoogleCodejam.GCJ2012.qualification;

import java.io.FileNotFoundException;
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;

/**
 * Created with IntelliJ IDEA.
 * User: addepar
 * Date: 4/14/12
 * Time: 2:27 PM
 * To change this template use File | Settings | File Templates.
 */
public class ProblemB {
    public static void main(String args[]) throws FileNotFoundException {
        Scanner scanner = new Scanner(ProblemB.class.getResourceAsStream("b_small.in"));

        int tests = scanner.nextInt();


        for (int test = 1; test <= tests; test++) {
            int result = 0;

            int numGooglers = scanner.nextInt();
            int surprises = scanner.nextInt();
            int minscore = scanner.nextInt();

            int potential = 0;
            for(int i = 0; i < numGooglers; i++){
                //555  645
                //566  557
                //556  466

                int score = scanner.nextInt();
                int maxscore = score/3;

                if(score %3 >0){
                    maxscore++;
                }

                if(maxscore >= minscore){
                    result++;
                } else if((maxscore +1) == minscore){
                    if(score > 0 && (score %3 == 0 || score%3 == 2)){
                        potential++;
                    }
                }
            }


            result += Math.min(potential,surprises);


            System.out.println("Case #" + test + ": " + result);
        }

    }
}


