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.util.Scanner;

public class Googlers {

	public static void main(String[] args) {
		// 3p-4 n 3p-3 are critical..
		Scanner c = new Scanner(System.in);
		int t = c.nextInt();
		for (int i = 1; i <= t; ++i) {
			System.out.print("Case #" + i + ": ");
			int n = c.nextInt();
			int s = c.nextInt();
			int p = c.nextInt();
			int count = 0, num;
			if (p == 0) {
				int m=n;
				while(n-- >0)
					c.nextInt();
				System.out.println(m);
			} else if (p == 1) {
				while(n-- >0)
					if(c.nextInt() > 0)
						count++;
				System.out.println(count);
			} else {
				while (n-- > 0)
					if ((num = c.nextInt()) < 3 * p - 4)
						continue;
					else if (num < 3 * p - 2 && s-- > 0)
						count++;
					else if (num >= 3 * p - 2)
						count++;
				System.out.println(count);
			}
		}

	}

}
