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.FileOutputStream;
import java.io.FileReader;
import java.io.PrintWriter;

public class Googlers {
	public static void main(String[] args) throws Exception {
		BufferedReader input = new BufferedReader(new FileReader("B-large.in"));
		PrintWriter output = new PrintWriter(new FileOutputStream("output_large.txt"));
		
		int T = Integer.parseInt(input.readLine());
		String line;
		String[] Ts = new String[103];
		
		int N, S, P, M, Ti;
		
		for (int i = 1; i <= T; i++) {
			line = input.readLine();
			Ts = line.split(" ");
			N = Integer.parseInt(Ts[0]);
			S = Integer.parseInt(Ts[1]);
			P = Integer.parseInt(Ts[2]);
			M = 0;
			
			for (int j = 0; j < N; j++) {
				Ti = Integer.parseInt(Ts[j+3]);
				if (P == 0) {
					M++;
				} else if(Ti > 0) {
					if (Ti >= 3*P-2) {
						M++;
					} else if (Ti >= 3*P-4 && S > 0) {
						M++;
						S--;
					}
				}
			}
			
			output.println("Case #" + i + ": " + M);
		}
		
		input.close();
		output.close();
	}
}
