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.*;

public class Dancing {

	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int T = in.nextInt(), N, S, p, total;
		int[] scores;
		String output = "";

		for (int i = 0; i < T; i++) {
			N = in.nextInt();
			S = in.nextInt();
			p = in.nextInt();
			
			scores = new int[N];
			for (int j = 0; j < N; j++)
				scores[j] = in.nextInt();
			Arrays.sort(scores);
			
			total = 0;
			for (int j = N-1; j >= 0; j--) {
				if (p == 0)
					total++;
				else if (scores[j] == 0)
					continue;
				else if (scores[j]/3 >= p || (scores[j]/3 == p - 1 && scores[j]%3 > 0))
					total++;
				else if (S > 0 && (scores[j]/3 == p - 1 || (scores[j]/3 == p - 2 && scores[j]%3 == 2))) {
					S--;
					total++;
				}
			}
			if (p > 10)
				total = 0;
			output += "Case #" + (i+1) + ": " + total + "\n";
		}
		System.out.print(output);
	}
}
