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

public class B {

	private int n, p, a[], memo[][];

	private void work() throws IOException {
		Scanner sc = new Scanner(new FileReader("B-large.in"));
		PrintWriter pw = new PrintWriter(new FileWriter("B-large.out"));
		a = new int[200];
		memo = new int[200][200];
		int nc = sc.nextInt();
		for (int tc = 1; tc <= nc; tc++) {
			pw.printf("Case #%d: ", tc);
			n = sc.nextInt();
			int s = sc.nextInt();
			p = sc.nextInt();
			for (int i = 0; i < n; i++) {
				a[i] = sc.nextInt();
				Arrays.fill(memo[i], Integer.MIN_VALUE);
			}
			int res = go(0, s);
			if (res < 0)
				res = 0;
			pw.printf("%d\n", res);
		}
		pw.close();
	}

	private int go(int pos, int s) {
		if (pos == n)
			return s == 0 ? 0 : -200;
		if (memo[pos][s] > Integer.MIN_VALUE)
			return memo[pos][s];
		int k = a[pos] / 3;
		int m = a[pos] % 3;
		int max = k;
		if (m > 0)
			max++;
		int maxs = k + 1;
		if (m == 2)
			maxs++;
		int ret = (max >= p ? 1 : 0) + go(pos + 1, s);
		if (s > 0 && (k > 0 || m == 2)) {
			int t = (maxs >= p ? 1 : 0) + go(pos + 1, s - 1);
			if (t > ret)
				ret = t;
		}
		return memo[pos][s] = ret;
	}

	public static void main(String[] args) throws IOException {
		new B().work();
	}

}
