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.BufferedWriter;
import java.io.File;
import java.io.FileWriter;
import java.util.Scanner;

/**
 * GoogleDancers Class
 * 
 * @author ndiwan
 * 
 */
public class GoogleDancers {

	/**
	 * Main method for calculating best results of Google dancers
	 * 
	 * @param args
	 */
	public static void main(String[] args) {

		int testCases;
		int googlers;
		int surprising;
		int cutOff;
		int[] marks;
		int bestResult = 0;

		BufferedWriter bw = null;
		Scanner scan = null;

		try {

			bw = new BufferedWriter(new FileWriter("Output.txt"));
			scan = new Scanner(new File("Input.txt"));

			testCases = scan.nextInt();

			for (int i = 1; i <= testCases; i++) {

				googlers = scan.nextInt();
				surprising = scan.nextInt();
				cutOff = scan.nextInt();
				bestResult = 0;

				marks = new int[googlers];

				// storing marks for googlers
				for (int j = 0; j < googlers; j++) {
					marks[j] = scan.nextInt();
				}

				// processing marks in triplets
				for (int k = 0; k < marks.length; k++) {

					int div = marks[k] / 3;
					int rem = marks[k] % 3;

					if (div != 0) {
						if (div >= cutOff) {
							++bestResult;
						} else {
							if (cutOff - div == 1) {
								if (rem >= 1) {
									++bestResult;
								} else if (surprising > 0) {
									++bestResult;
									--surprising;
								}
							}
							if (cutOff - div == 2 && rem > 1 && surprising > 0) {
								++bestResult;
								--surprising;
							}
						}
					}
					else {
						if (cutOff == 0 || rem >= cutOff){
							++bestResult;
						}
						else if (rem >= cutOff && surprising > 0) {
							++bestResult;
							--surprising;
						}
					}
				}

				bw.write("Case #" + i + ": " + bestResult + "\n");
			}

		} catch (Exception e) {
			System.out.println("Exception " + e);
			e.printStackTrace();
			
		} finally {
			scan.close();
			try {
				bw.close();
			} catch (Exception e) {
				e.printStackTrace();
			}
		}
	}
}