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 tr0llhoehle.cakemix.googleCodejam;

import tr0llhoehle.cakemix.utility.googleCodeJam.Solver;

public class DWGSolver implements Solver<DWGProblem> {

	@Override
	public String solve(DWGProblem p) {
		int numberOfBestResult = 0;
		int surprising = 0;

		/*
		 * for (int sum : p.getDancerSums()) { int[] triplet = new int[3];
		 * boolean done = false; int remainder = sum % 3;
		 * 
		 * for (int i : triplet) { i = sum / 3;
		 * 
		 * if (remainder > 0) { i++; remainder--; } // not-surprising triplets
		 * generated.
		 * 
		 * if (i >= p.getBorder()) { numberOfBestResult++; done = true; break; }
		 * }
		 * 
		 * if (!done && sum > 1 && surprising < p.getNumberOfSuprisingTriplets()
		 * && triplet[0] + 1 >= p.getBorder()) { numberOfBestResult++;
		 * surprising++;
		 * 
		 * } }
		 */

		for (int sum : p.getDancerSums()) {
			int avg = sum / 3;
			int remainder = sum % 3;

			if (sum == 0) {
				if (p.getBorder() <= 0) {
					numberOfBestResult++;
				}
			} else if (sum == 1) {
				if (p.getBorder() <= 1) {
					numberOfBestResult++;
				}
			} else { // sum >= 2
				switch (remainder) {
				case 0:
					if (avg >= p.getBorder()) {
						numberOfBestResult++;
					} else if (surprising < p.getNumberOfSuprisingTriplets()
							&& avg + 1 >= p.getBorder()) {
						numberOfBestResult++;
						surprising++;
					}
					break;
				case 1:
					if (avg + 1 >= p.getBorder()) {
						numberOfBestResult++;
					}
					break;
				case 2:
					if (avg + 1 >= p.getBorder()) {
						numberOfBestResult++;
					} else if (surprising < p.getNumberOfSuprisingTriplets()
							&& avg + 2 >= p.getBorder()) {
						numberOfBestResult++;
						surprising++;
					}
					break;
				}
			}
		}

		return numberOfBestResult + "";
	}
}
