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.FileInputStream;
import java.io.FileNotFoundException;
import java.io.PrintStream;
import java.text.MessageFormat;
import java.util.Map;
import java.util.Scanner;


public class QualQ2 {


	private final Scanner inputScanner = new Scanner(System.in);

	private Scanner testCaseScanner;

	private int answer;
	
	int[] scores;
	
	int N;
	int p;
	int S;
	/**
	 * @param args
	 */
	public static void main(String[] args) {
		QualQ2.init();
		QualQ2 speaking = new QualQ2();
		speaking.solve();
	}

	private static void init() {
		try {
			System.setIn(new FileInputStream("in.txt"));
			System.setOut(new PrintStream("out.txt"));
		} catch (FileNotFoundException e) {
			e.printStackTrace();
		}
	}

	private void solve() {
		// Number of test cases
		int T = inputScanner.nextInt();
		inputScanner.nextLine();
		for (int i = 1; i <= T; i++) {
			initTestCase();
			readTestCase();
			solveTestCase();
			printTestCase(i);
		}
	}


	private void initTestCase() {
		answer = 0;
	}

	private void readTestCase() {
		testCaseScanner = new Scanner(inputScanner.nextLine());
		
		N = testCaseScanner.nextInt();
		S = testCaseScanner.nextInt();
		p = testCaseScanner.nextInt();
		
		scores = new int[N];
		for (int i=0;i<N;i++)
			scores[i] = testCaseScanner.nextInt();

	}

	private void solveTestCase() {
		if (p==0) {
			answer = N;
			return;
		}
		
		for (int i=0;i<N;i++) {
			int high = (int)(Math.ceil(((float) scores[i] / 3.0f)));
			if (high >= p) {
				answer++;
				continue;
			}
			if (high == p-1 && S>0 && high !=0) {
				int mod = scores[i] % 3;
				if (mod == 0 || mod == 2) {
					answer++;
					S--;
				}				
			}			 
		}
	}


	private final MessageFormat printFormat = new MessageFormat("Case #{0}: ");

	private void printTestCase(int num) {
		System.out.print(printFormat.format(new Object[] { num }));
		System.out.println(answer);
	}
}
