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

import java.util.Scanner;
import java.util.StringTokenizer;

public class DancingWiththeGooglers {

	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		int cases = Integer.parseInt(scan.nextLine());
		for (int i = 0; i < cases; i++) {
			String temp = scan.nextLine();
			StringTokenizer token = new StringTokenizer(temp);
			int N = Integer.parseInt(token.nextToken());
			int S = Integer.parseInt(token.nextToken());
			int P = Integer.parseInt(token.nextToken());
			int[] total = new int[N];
			for (int j = 0; j < total.length; j++) {
				total[j] = Integer.parseInt(token.nextToken());
			}
			System.out.println("Case #" + (i + 1) + ": " + solve(total, S, P));

		}

	}

	private static int solve(int[] total, int s, int p) {
		int ser = s;
		int numberOfWinners = 0;
		for (int i = 0; i < total.length; i++) {
			if (total[i] == 0) {
				if (p == 0)
					numberOfWinners++;
			} else if (total[i] == 1) {
				if (p <= 1)
					numberOfWinners++;
			} else if (total[i] == 2) {
				if (p <= 1)
					numberOfWinners++;
				else if (p == 2 && ser > 0) {
					numberOfWinners++;
					ser--;
				}
			} else {
				int k = total[i] % 3;
				if (k == 0) {
					if (total[i] / 3 >= p)
						numberOfWinners++;
					else if (((total[i] / 3) + 1) >= p && ser > 0) {
						numberOfWinners++;
						ser--;
					}
				} else if (k == 2) {
					int sum = (total[i] / 3) + 1;
					if (sum >= p)
						numberOfWinners++;
					else if ((sum + 1) >= p && ser > 0) {
						numberOfWinners++;
						ser--;
					}

				} else if (k == 1) {
					int sum = (total[i] / 3) + 1;
					if (sum >= p)
						numberOfWinners++;
				}
			}
		}
		return numberOfWinners;

	}
}
