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

import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.Map;
import java.util.Scanner;

public class TB {

	private Map<Character, Character> translate = null;
	
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		PrintWriter out = new PrintWriter(System.out);
		try {
			File file = new File("src/qualifier/B-large.in");
			String a = file.getAbsolutePath();
			in = new Scanner(file);
			out = new PrintWriter(new File("src/qualifier/B-large.out"));
		} catch (FileNotFoundException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}
		
		TB worker = new TB();
		int n = in.nextInt();
		
		for (int i=1; i<=n; i++) {
			int k = in.nextInt();
			int s = in.nextInt();
			int p = in.nextInt();
			
			int[] scores = new int[k];
			for (int j=0;j<k;j++) {
				scores[j] = in.nextInt();
			}
			out.println("Case #" + i + ": " + worker.maxGs(k,p,s,scores));
		}
		out.flush();
	}
	
	public int maxGs(int k, int p, int s, int[] scores) {
		int res = 0;
		int subres = 0;
		int acceptable = 3*p-4;
		if (p == 1) acceptable = 1;
		for (int i=0; i<k; i++)
			if (scores[i]>=3*p-2) 
				res++;
			else if (scores[i]>=acceptable) subres++;
			
		res += Math.min(subres, s);
		return res;
	}
}
