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

public class Dancing {

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

		BufferedReader in = new BufferedReader(new FileReader("dancing.in"));
		PrintWriter out = new PrintWriter(new FileWriter("dancing.out"));

		String lineStr;
		int T, N, S, P, ti, result;

		T = Integer.parseInt(in.readLine());
		System.out.println(T + " test cases");

		for (int line = 1; line <= T; line++) {

			lineStr = in.readLine();
			String[] fields = lineStr.split(" ");
			N = Integer.parseInt(fields[0]);
			S = Integer.parseInt(fields[1]);
			P = Integer.parseInt(fields[2]);

			System.out.println("N=" + N + " S=" + S + " P=" + P);

			result = 0;
			for (int i = 0; i < N; i++) {
				ti = Integer.parseInt(fields[3 + i]);
				if (ti > (3 * (P - 1))) {
					// Guaranteed to have at least P and without surprise
					result++;
				} else if (ti >= 2 && ti <= 28 && ti >= (3 * (P - 1) - 1)) {
					// Have p but with surprise
					if (S > 0) {
						result++;
						// reduce available surprise
						S = S - 1;
					}
				}
			}

			out.println("Case #" + line + ": " + result);
			System.out.println(lineStr + " : " + result);
		}

		in.close();
		out.close();
	}

}
