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.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.PrintWriter;

public class Dancing {

	public static void main(String[] args) throws Exception {

		BufferedReader in = new BufferedReader(new FileReader("dancing.in"));
		PrintWriter out = new PrintWriter(new FileWriter("dancing.out"));

		String lineStr;
		int T, N, S, P, ti, result;

		T = Integer.parseInt(in.readLine());
		System.out.println(T + " test cases");

		for (int line = 1; line <= T; line++) {

			lineStr = in.readLine();
			String[] fields = lineStr.split(" ");
			N = Integer.parseInt(fields[0]);
			S = Integer.parseInt(fields[1]);
			P = Integer.parseInt(fields[2]);

			System.out.println("N=" + N + " S=" + S + " P=" + P);

			result = 0;
			for (int i = 0; i < N; i++) {
				ti = Integer.parseInt(fields[3 + i]);
				if (ti > (3 * (P - 1))) {
					// Guaranteed to have at least P and without surprise
					result++;
				} else if (ti >= 2 && ti <= 28 && ti >= (3 * (P - 1) - 1)) {
					// Have p but with surprise
					if (S > 0) {
						result++;
						// reduce available surprise
						S = S - 1;
					}
				}
			}

			out.println("Case #" + line + ": " + result);
			System.out.println(lineStr + " : " + result);
		}

		in.close();
		out.close();
	}

}
