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 Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int testCases = sc.nextInt();
		for (int i = 1; i <= testCases; i++) {
			int n = sc.nextInt();
			int s = sc.nextInt();
			int p = sc.nextInt();
			int[] points = new int[n];
			int result = 0;
			boolean[] flags = new boolean[n];
			for (int j = 0; j < n; j++) {
				int temp = sc.nextInt();
				if (temp == 0) {
					points[j] = 0;
					flags[j] = false;
				} else if (temp % 3 == 0) {
					points[j] = temp / 3;
					flags[j] = true;
				} else if (temp % 3 == 1) {
					points[j] = temp / 3 + 1;
					flags[j] = false;
				} else {
					points[j] = temp / 3 + 1;
					flags[j] =true;
				}
			}
			for (int j = 0; j < n; j++) {
				if (points[j] >= p) {
					result += 1;
					flags[j] = false;
				}
			}
			int currentSurprising = 0;
			for (int j = 0; j < n && currentSurprising < s; j++) {
				if (flags[j] && points[j] + 1 >= p) {
					result += 1;
					currentSurprising += 1;
				}
			}
			System.out.println("Case #" + i + ": " + result);
		}
	}	
}
