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 com.google.codejam2012.qual.b;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;

public class DancingWithTheGooglers {

    /**
     * @param args
     * @throws IOException 
     */
    public static void main(String[] args) throws IOException {
        BufferedReader reader = new BufferedReader(new FileReader("2012/qualB/input.txt"));
        PrintWriter writer = new PrintWriter(new BufferedWriter(new FileWriter("2012/qualB/output.txt")));

        int numberOfTests = Integer.parseInt(reader.readLine()); // T

        for (int i = 0; i < numberOfTests; i++) {
            System.out.println(i);
            String[] testCase = reader.readLine().split(" ");
            int numberOfGooglers = Integer.parseInt(testCase[0]); // N
            int numberOfSurprisingTriplets = Integer.parseInt(testCase[1]); // S
            int minBestResult = Integer.parseInt(testCase[2]); // p
            //int[] totalPoints = new int[numberOfGooglers];
        	int countOk = 0, surprises = 0;
        	if (minBestResult == 0) {
        		countOk = numberOfGooglers;
        	} else {
	            for (int j = 0; j < numberOfGooglers; j++) {
	            	int totalPoints = Integer.parseInt(testCase[j + 3]); // ti
	            	int minTotal = minBestResult + (2 * (minBestResult - 1));
	            	if (totalPoints >= minTotal) {
	            		// ok without surprise
	            		countOk++;
	            	} else if (minBestResult > 1) {
	            		minTotal = minBestResult + (2 * (minBestResult - 2));
	            		if (totalPoints >= minTotal) {
		            		// ok with surprise
		            		surprises++;
		            		if (surprises <= numberOfSurprisingTriplets) {
		            			countOk++;
		            		}
	            		}
	            	}
	            }
        	}

            writer.println("Case #" + (i + 1) + ": " + countOk);
        }

        writer.flush();
        writer.close();
        reader.close();
    }

}
