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

/*
 * @author Magix.Lu
 */

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

public class Dancing {

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

		int count = 0;
		int special = 0;
		int googler = 0;
		int best = 0;
		int sp_co = 0;
		int sat = 0;

		Scanner scanInput = new Scanner(System.in);
		String target = scanInput.next();

		File inputFile = new File(target);
		Scanner fileScan = new Scanner(inputFile);

		String outpFileName = "output.txt";
		FileWriter googlewriter = null;
		googlewriter = new FileWriter(outpFileName);

		PrintWriter diskFile = new PrintWriter(googlewriter);

		count = fileScan.nextInt();

		for (int i = 0; i < count; i++) {
			googler = fileScan.nextInt();
			special = fileScan.nextInt();
			best = fileScan.nextInt();
			sp_co = 0;
			sat = 0;

			int[][] scores = new int[googler][3];
			int[] totscores = new int[googler];

			for (int j = 0; j < googler; j++)
				totscores[j] = fileScan.nextInt();

			for (int j = 0; j < googler; j++) {
				scores[j][0] = totscores[j] / 3;
				scores[j][1] = totscores[j] / 3;
				scores[j][2] = totscores[j] / 3;
			}

			for (int j = 0; j < googler; j++) {
				if (scores[j][0] + scores[j][1] + scores[j][2] != totscores[j]) {
					if (totscores[j] - scores[j][0] - scores[j][1]
							- scores[j][2] == 2) {
						scores[j][0]++;
						scores[j][2]++;
					}
					if (totscores[j] - scores[j][0] - scores[j][1]
							- scores[j][2] == 1) {
						scores[j][0]++;
					}
				}
			}

			for (int m = 0; m < googler; m++) {
				if (scores[m][0] >= best || scores[m][1] >= best
						|| scores[m][2] >= best) {
				} else if (sp_co < special && scores[m][0] != 0
						&& scores[m][0] + 1 == best) {
					scores[m][0]--;
					scores[m][2]++;
					sp_co++;
				}
			}

			for (int m = 0; m < googler; m++) {
				if (scores[m][0] >= best || scores[m][1] >= best
						|| scores[m][2] >= best)
					sat++;
			}

			diskFile.print("Case #" + (i + 1) + ": " + sat + "\n");

		}

		diskFile.close();

	} // end of main

} // end of class
