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.codejam;

import com.google.codejam.util.CodeJamInputFile;
import com.google.codejam.util.CodeJamOutputFile;

public class Dancer {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		CodeJamInputFile f = new CodeJamInputFile("in/B-large.in");
		
		CodeJamOutputFile fo = new CodeJamOutputFile("out/B-large.out");
		
		for(int c = 0; c < f.getCases(); c++){
			int count = 0;
			String line = f.getLine();
			String[] tokens = line.split(" ");
			int goog = Integer.valueOf(tokens[0]);
			int surp = Integer.valueOf(tokens[1]);
			int best = Integer.valueOf(tokens[2]);
			for(int g = 3; g < (goog + 3); g++){
				int tot = Integer.valueOf(tokens[g]);
				System.out.print(tot + " - ");
				if(tot > ((best * 3) - 3)){
					count++;
					continue;
				}
				if((surp > 0) && (tot > ((best * 3) - 5)) && (tot > 2)){
					count++;
					surp--;
				}
			}
			System.out.println(count + "");
			fo.writeCase(c, count + "");
		}
		
		f.close();
		fo.close();
	}

}
