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 java.io.BufferedWriter;
import java.io.File;
import java.io.FileWriter;
import java.io.IOException;
import java.util.Scanner;

public class Main {

	/**
	 * @param args
	 * @throws FileNotFoundException
	 */
	
	static Scanner in;
	static BufferedWriter writer;
	public static void main(String[] args) throws IOException {
		
		in = new Scanner(new File("src/B-large.in"));
		writer = new BufferedWriter(new FileWriter(new File("src/b.out")));

		int T = in.nextInt();
		
		for (int i = 1; i <= T; i++) {
			int N = in.nextInt();
			int S = in.nextInt();
			int P = in.nextInt();
			int[] t = new int[N];
			
			for (int j = 0; j < N; j++) {
				t[j] = in.nextInt();
			}
			solveCase(i, N, S, P, t);
		}
		
		writer.close();

	}

	public static int solveCase(int TEST_CASE, int N, int S, int P, int[] t) throws IOException {
		int ans = 0;
		int minSc = 3*P-2;
		int minScSup = (P==1)?1:3*P-4;
		int validCom = 0;
		int validSup = 0;
		for (int i = 0; i < t.length; i++) {
			if(t[i]>=minSc)
				validCom++;
			else if (t[i]<minSc && t[i]>=minScSup) {
				validSup++;
			}
		}
		if(validSup<=S) ans = validCom + validSup;
		else {
			ans = validCom + S;
		}
		writer.write("Case #" + TEST_CASE + ": " + ans);
		writer.newLine();
		return 0;
	}

}
