package code12.qualification;

import java.io.File;
import java.io.FileWriter;
import java.util.Scanner;

public class B {
	public static String solve(int N, int S, int p, int[] t) {
		
		// 3a 		-> (a, a, a), *(a - 1, a, a + 1)
		// 3a + 1	-> (a, a, a + 1), *(a - 1, a + 1, a + 1)
		// 3a + 2	-> (a, a + 1, a + 1), *(a, a, a + 2)
		
		int numPNoS = 0;
		int numPWithS = 0;
		
		for (int i = 0; i < N; i++) {
			int a = (int)Math.floor(t[i] / 3);
			int r = t[i] % 3;
			
			switch (r) {
			case 0:
				if (a >= p) {
					numPNoS++;
				} else if (a + 1 >= p && a - 1 >= 0) {
					numPWithS++;
				}
				break;
			case 1:
				if (a >= p || a + 1 >= p) {
					numPNoS++;
				}
				break;
			case 2:
				if (a >= p || a + 1 >= p) {
					numPNoS++;
				} else if (a + 2 >= p) {
					numPWithS++;
				}
				break;
			}
		}
		
		return "" + (numPNoS + Math.min(S, numPWithS));
	}

	public static void main(String[] args) throws Exception {
		// file name
		//String fileName = "Sample";
		//String fileName = "B-small";
		String fileName = "B-large";
		
		// file variable
		File inputFile = new File(fileName + ".in");
		File outputFile = new File(fileName + ".out");
		Scanner scanner = new Scanner(inputFile);
		FileWriter writer = new FileWriter(outputFile);

		// problem variable
		int totalCase;
		int N, S, p;
		int[] t;

		// get total case
		totalCase = scanner.nextInt();

		for (int caseIndex = 1; caseIndex <= totalCase; caseIndex++) {
			// get input
			N = scanner.nextInt();
			S = scanner.nextInt();
			p = scanner.nextInt();
			t = new int[N];
			
			for (int i = 0; i < N; i++) {
				t[i] = scanner.nextInt();
			}
			
			String output = "Case #" + caseIndex + ": " + solve(N, S, p, t);
			System.out.println(output);
			writer.write(output + "\n");
		}
		scanner.close();
		writer.close();
	}
}

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();
	}

}
