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

import java.io.*;
import java.lang.Math.*;
import java.util.HashMap;

public class B {

	public static void main(String[] args) {

		try {
			BufferedReader input = new BufferedReader(new FileReader("C:/CodeJam/B-small-attempt2.in"));
			BufferedWriter output = new BufferedWriter(new FileWriter("C:/CodeJam/B-small-attempt2.out"));
			try {
				int T = Integer.parseInt(input.readLine());

				//Process each case
				for (int i = 0; i < T; i++) {
					String line = input.readLine();

					String[] data = line.split(" ");
					int N = Integer.parseInt(data[0]);
					int S = Integer.parseInt(data[1]);
					int p = Integer.parseInt(data[2]);

					//Count the possible surprising/unsurprising scores
					int countU = 0;
					int countS = 0;
					for (int j = 0; j < N; j++) {
						int score = Integer.parseInt(data[j + 3]);

						//Minimum score to be surprising/unsurprising
						int minScoreS = 2 * (p - 2) + p;
						int minScoreU = 2 * (p - 1) + p;
						if (p == 0) {
							countU++;
						} else if (p == 1 && score > 0) {
							countU++;
						} else if (minScoreU >= 0 && score >= minScoreU) {
							countU++;
						} else if (minScoreS >= 0 && score >= minScoreS) {
							countS++;
						}
					}
					output.write("Case #" + (i + 1) + ": " + (countU + Math.min(S, countS)) + "\n");
				}
			} finally {
				input.close();
				output.close();
			}
		} catch (IOException ex) {
			ex.printStackTrace();
		}
	}
}
