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.FileReader;
import java.io.FileWriter;
import java.util.StringTokenizer;

public class Main {

	public static void main(String[] args) throws Exception {

		FileReader in = new FileReader("F:\\download\\B-large.in");
		BufferedReader br = new BufferedReader(in);
		FileWriter out = new FileWriter("F:\\download\\out.txt");
		BufferedWriter bw = new BufferedWriter(out);

		int t = Integer.parseInt(br.readLine());
		for (int c = 0; c < t; c++){
			String line = br.readLine();
			StringTokenizer aSt = new StringTokenizer(line, " ");
			int number = Integer.valueOf(aSt.nextToken()).intValue();
			int surprise = Integer.valueOf(aSt.nextToken()).intValue();
			int p = Integer.valueOf(aSt.nextToken()).intValue();

			int sum_ok = 0;
			int sum_surprise = 0;
			for (int n = 0; n < number; n++){
				int ti = Integer.valueOf(aSt.nextToken()).intValue();
				int judge = judge(ti, p);
				switch (judge){
				case 2:
					sum_ok++;
					break;
				case 1:
					sum_surprise++;
					break;
				default:
					break;
				}
			}
			
			int result;
			if (sum_surprise <= surprise){
				result = sum_ok + sum_surprise;
			}
			else{
				result = sum_ok + surprise;
			}

			bw.write(String.format("Case #%d: %d\n", c+1, result));
		}
		
		br.close();
		in.close();
		bw.close();
		out.close();

	}
	
	private static int judge(int score, int p){
		int p1 = (p-1 >= 0) ? p-1: 0;
		if (score >= p + p1 + p1){
			return 2;
		}
		int p2 = (p-2 >= 0) ? p-2: 0;
		if (score >= p + p2 + p2){
			return 1;
		}
		return 0;
	}

}
