import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.StringTokenizer;


public class DancingWithTheGooglers {
	public static void main(String[] args) throws IOException {
		BufferedReader f = new BufferedReader (new FileReader("B-small.in"));
		PrintWriter out = new PrintWriter(new FileWriter("B-small.out"));
		
		int t = Integer.parseInt(f.readLine());
		for (int i = 0; i < t; i++){
			int c = 0;
			StringTokenizer st = new StringTokenizer(f.readLine());
			int n = Integer.parseInt(st.nextToken());
			int[] ti = new int[n];
			int s = Integer.parseInt(st.nextToken());
			int p = Integer.parseInt(st.nextToken());
			for (int j = 0; j < n; j ++){
				ti[j] = Integer.parseInt(st.nextToken());
				if (ti[j] % 3 == 0){
					if (ti[j] / 3 >= p)
						c++;
					else if (ti[j] / 3 == (p-1) && s > 0 && ti[j] >= 2){
						s--;
						c++;
					}
				}
				else if (ti[j] % 3 == 1){
					if ((ti[j] / 3) + 1 >= p)
						c++;					
				}
				else{
					if (ti[j] / 3 >= p-1)
						c++;
					else if (ti[j] / 3 == (p-2) && s > 0){
						s--;
						c++;
					}
				}
					
				
			}
			out.println("Case #" + (i+1) + ": " + c);
			
			
		}
		out.close();
		System.exit(0);
		
		
		
	}
}

package codejam.qualification;

import java.io.IOException;
import java.util.HashMap;
import java.util.Map;

import codejam.Task;

public class B extends Task {

	private int t;
	private String[][] testCases;
	private String[] resultset;

	public B(String[] args) {
		super(args);
	}

	public static void main(String[] args) throws IOException {
		Task taskB = new B(args);
		taskB.execute();
	}

	protected void catchInputData() throws IOException {
		t = Integer.parseInt(readLine());
		testCases = new String[t][];

		// iterates over cases
		for (int c = 0; c < t; c++) {
			testCases[c] = readLine().split(" ");
		}
	}

	protected void processInputData() {
		resultset = new String[t];

		// iterates over cases
		for (int c = 0; c < t; c++) {
			String[] testCase = testCases[c];
			
			int n = Integer.valueOf(testCase[0]);
			int s = Integer.valueOf(testCase[1]);
			int p = Integer.valueOf(testCase[2]);
			int y = 0;
			
			for (int i = 3; i < 3 + n; i++) {
				int t = Integer.valueOf(testCase[i]);
				if (Math.ceil((float) t / 3) >= p) {
					y++;
				} else if (s > 0 && t > 1 && (Math.round((float) t / 3) + 1) >= p) {
					y++;
					s--;
				}
			}
			
			resultset[c] = ""+y;
		}
	}

	protected void generateOutputFile() throws IOException {
		// iterates over cases
		for (int c = 0; c < t; c++) {
			writeLine("Case #" + (c + 1) + ": " + resultset[c]);
		}
	}

}
