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


public class Dance {

	/**
	 * @param args
	 * @throws IOException 
	 */
	public static void main(String[] args) throws IOException {
		Scanner sc = new Scanner(new File("B-large.in"));
		FileWriter fw = new FileWriter("dance1.txt");
		int k=0;
		int n = Integer.parseInt(sc.nextLine());
		for(int j = 0; j<n; j++){
			k++;
			String ln = sc.nextLine();
			fw.write("Case #"+k+": ");
			String arr[] = ln.split(" ");
			//int num = Integer.parseInt(arr[0]);
			int s = Integer.parseInt(arr[1]);
			int p = Integer.parseInt(arr[2]);
			int count = 0;
			for(int i=3; i<arr.length; i++){
				int t = Integer.parseInt(arr[i]);
				if(t>=p){
					if(Math.max(0, 3*p-2) <= t)
						count++;
					else if (Math.max(0, 3*p-4) <= t && s>0){
						count++;
						s--;
					}
				}
			}
			fw.write(count+"\n");

		}
		sc.close();
		fw.close();
	}

}
