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.util.ArrayList;
import java.util.List;
import java.util.Scanner;

public class GooglerDanceSolver {

	public static int getMaximumPassCount(int passScore, int surpriseCount, List<Integer> scores) {
		int passCount = 0;

		int lowerBound = (passScore > 1) ? 3 * passScore - 4 : passScore;
		
		for (int score : scores) {
			if (score < lowerBound) {
				continue;
			} else if (score > 3 * passScore - 3) {
				passCount++;
			} else if (surpriseCount > 0) {
				passCount++;
				surpriseCount--;
			}
		}
		
		return passCount;
	}
	
	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner scanner = new Scanner(System.in);
		int totalCount = Integer.parseInt(scanner.nextLine());
		
		for (int i = 0; i < totalCount; i++) {
			String[] inputs = scanner.nextLine().split(" ");
			int n = Integer.parseInt(inputs[0]);
			int s = Integer.parseInt(inputs[1]);
			int p = Integer.parseInt(inputs[2]);
			List<Integer> scores = new ArrayList<Integer>(n);
			for (int j = 0; j < n; j++) {
				scores.add(Integer.parseInt(inputs[j+3]));
			}
			int answer = GooglerDanceSolver.getMaximumPassCount(p, s, scores);
			System.out.printf("Case #%d: %d%n", i+1, answer);
			//System.err.printf("[Debug Info] p=%d, s=%d, scores=%s%n", p, s, scores.toString());
		}
	}

}
