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

import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.OutputStream;
import java.io.PrintStream;
import java.util.ArrayList;
import java.util.Scanner;

public class DancingWithTheGooglersClean {
	public static void main(String[] args) throws FileNotFoundException {

		 Scanner in = new Scanner(
		 new File(
		 "/Users/olvitole/Dropbox/workspace/Googe Code/src/gcj2012/files/B-large.in"));
		int t = Integer.parseInt(in.nextLine());
		OutputStream outStr = new FileOutputStream(
				"/Users/olvitole/Dropbox/workspace/Googe Code/src/gcj2012/files/Bl-output.txt");
		PrintStream printOut = new PrintStream(outStr);
		for (int zz = 1; zz <= t; zz++) {
			String input = in.nextLine().trim();
			String parts[] = input.split(" ");
			int n = Integer.parseInt(parts[0]);
			int s = Integer.parseInt(parts[1]);
			int p = Integer.parseInt(parts[2]);
			ArrayList<Integer[]> triplets = new ArrayList<Integer[]>();
			int tempTp = 0;
			int tempScore = 0;
			int count = 0;
			for (int i = 0; i < n; i++) {
				tempTp = Integer.parseInt(parts[3 + i]);

				if (tempTp % 3 == 0) {
					tempScore = tempTp / 3;
					Integer[] tempTrip = { tempScore, tempScore, tempScore };
					triplets.add(tempTrip);
				} else if (tempTp % 3 == 1) {
					tempScore = tempTp / 3;
					Integer[] tempTrip = { tempScore, tempScore,
							(tempScore + 1) };
					triplets.add(tempTrip);
				} else if (tempTp % 3 == 2) {
					tempScore = tempTp / 3;
					Integer[] tempTrip = { tempScore, (tempScore + 1),
							(tempScore + 1) };
					triplets.add(tempTrip);
				}

			}

			for (Integer[] intPrint : triplets) {
				if (intPrint[2] >= p) {
					count++;
				} else {
					if ((intPrint[2] + 1 == p) && intPrint[1] > 0
							&& (intPrint[2] == intPrint[1])) {

						if (s > 0) {
							s--;
							count++;
						}
					} 

				}
			}


			String output = count + "";
			printOut.append("Case #" + zz + ": " + output + "\n");
		}

		System.setOut(printOut);
	}

}
