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 Dancing {
	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		int n = scan.nextInt();
		int[] array = new int[n];
		for (int i = 0; i < n; i++) {
			int k = scan.nextInt();
			int[] arrayInt = new int[k];
			int s = scan.nextInt();
			int p = scan.nextInt();
			for (int j = 0; j < k; j++)
				arrayInt[j] = scan.nextInt();
			int a = 0;
			for (int j = 0; j < k; j++) {
				int div = arrayInt[j] / 3;
				int rem = arrayInt[j] - div * 3;
				if (rem == 0) {
					if (div >= p)
						a++;
					else if (div == p - 1 && s >= 1 && div - 1 >= 0) {
						a++;
						s--;
					}
				} else if (rem == 1) {
					if (div >= p - 1)
						a++;
				} else {
					if (div >= p - 1)
						a++;
					else if (div == p - 2 && s >= 1) {
						a++;
						s--;
					}
				}
			}
			array[i] = a;
		}
		for (int i = 1; i <= n; i++)
			System.out.println("Case #" + i + ": " + array[i - 1]);
	}
}
