package codejam;

import fixjava.Pair;

public class Utils {

	public static long minLong(long firstVal, long... otherVals) {
		long minVal = firstVal;
		for (int i = 0; i < otherVals.length; i++)
			minVal = Math.min(firstVal, otherVals[i]);
		return minVal;
	}

	public static int minInt(int firstVal, int... otherVals) {
		int minVal = firstVal;
		for (int i = 0; i < otherVals.length; i++)
			minVal = Math.min(firstVal, otherVals[i]);
		return minVal;
	}

	public static float minFloat(float firstVal, float... otherVals) {
		float minVal = firstVal;
		for (int i = 0; i < otherVals.length; i++)
			minVal = Math.min(firstVal, otherVals[i]);
		return minVal;
	}

	/**
	 * ArgMin returned as a Pair<Integer, Integer>(index, value). Array must
	 * have at least one value.
	 */
	public static Pair<Integer, Integer> argMin(int[] arr) {
		int min = arr[0];
		int argMin = 0;
		for (int i = 1; i < arr.length; i++) {
			if (arr[i] < min) {
				min = arr[i];
				argMin = i;
			}
		}
		return new Pair<Integer, Integer>(argMin, min);
	}

	/**
	 * ArgMax returned as a Pair<Integer, Integer>(index, value). Array must
	 * have at least one value.
	 */
	public static Pair<Integer, Integer> argMax(int[] arr) {
		int max = arr[0];
		int argMax = 0;
		for (int i = 1; i < arr.length; i++) {
			if (arr[i] > max) {
				max = arr[i];
				argMax = i;
			}
		}
		return new Pair<Integer, Integer>(argMax, max);
	}

}

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.ArrayList;
import java.util.regex.Matcher;
import java.util.regex.Pattern;


public class Ex2 {


	public static void main(String[] args) throws IOException{
		String dir = System.getProperty("user.dir");
		String lineOfText;
		int T = 0;
		BufferedReader input = new BufferedReader(new FileReader(dir + "\\B-large.in"));
		BufferedWriter output = new BufferedWriter(new FileWriter(dir + "\\B-large.out"));		
		try {

			lineOfText = input.readLine();
			T = Integer.parseInt(lineOfText);
			
			int N=0;
			lineOfText = input.readLine();
			while (lineOfText!=null) {
				N++;
				StringBuilder newString = new StringBuilder();	
				
				Pattern p = Pattern.compile("-?\\d+");
				Matcher m = p.matcher(lineOfText);
				m.find();
				int googlers = Integer.parseInt(m.group());
				m.find();
				int surprises =  Integer.parseInt(m.group());
				m.find();
				int limit =  Integer.parseInt(m.group());
				ArrayList<Integer> points = new ArrayList<Integer>();
				for(int i=0;i<googlers;i++){
					m.find();
					points.add(Integer.parseInt(m.group()));
				}
				
				int result = 0;
				if(limit>=2){
					for(int i=0;i<googlers;i++){
						if(points.get(i)>=(limit+limit-1+limit-1)){
							result++;
						} else if(surprises>0 && points.get(i)==(limit+limit-1+limit-2)){
							surprises--;
							result++;
						} else if(surprises>0 && points.get(i)==(limit+limit-2+limit-2)){
							surprises--;
							result++;
						}
					}
				} else if(limit==1){
					for(int i=0;i<googlers;i++){
						if(points.get(i)>=(limit)){
							result++;
						}
					}
				} else if(limit==0){
					result = googlers;
				}
				lineOfText = input.readLine();
				
				newString.append("Case #"+N+": "+result);
				output.write(newString.toString());
				output.newLine();
			}
			
			
						
			
			
		} catch (FileNotFoundException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		} finally {
			input.close();
			output.close();
		}
		
	}

}
