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.*;
import java.util.*;

public class BDancingGooglers {
	public static void main(String[] args) throws IOException {
		// parsing file
		Scanner scanner = new Scanner(new File("B-large.in"));
		int cases = Integer.parseInt(scanner.nextLine());
		int[][] lineArray = new int[cases][];
		int index = 0;
		while (scanner.hasNextLine()) {
			String line = scanner.nextLine();
			String[] split = line.split("\\s");
			lineArray[index] = new int[split.length];
			for (int i = 0; i < split.length; i++) {
				lineArray[index][i] = Integer.parseInt(split[i]);
			}

			// printing parsed information
			for (int i = 0; i < split.length; i++) {
//				System.out.print(lineArray[index][i] + " ");
			}
//			System.out.println();
			//

			index++; // DON'T DELETE
		}

		// doing computation by case
		FileWriter fw = new FileWriter("outputb.txt");
		for (int i = 0; i < lineArray.length; i++) {
			int count = 0;
			// int googlers = lineArray[i][0];
			int surprises = lineArray[i][1];
			int p = lineArray[i][2];
//			System.out.println("p is " + p + ", surprises is " + surprises);
			int base1 = Math.max(3 * p - 2, 0);
			int base2 = Math.max(3 * p - 4, 0);
			for (int j = 3; j < lineArray[i].length; j++) {
				if (p == 0) {
					count++;
				}
				else if (lineArray[i][j] == 0) {
					
				}
				else if (base1 <= lineArray[i][j]) {
					count++;
//					System.out.println("\tscore " + lineArray[i][j] + ", count " + count);
				} else if (base2 <= lineArray[i][j] && surprises != 0) {
					count++;
					surprises--;
//					System.out.println("\t2score " + lineArray[i][j] + ", count " + count + ", surprises left " + surprises);
				} else {
//					System.out.println("\t3score " + lineArray[i][j]);
				}
			}
			fw.write("Case #" + (i + 1) + ": " + count + "\n");
//			System.out.println("Case #" + (i + 1) + ": " + count);
//			System.out.println();
		}
		fw.close();
	}

}
