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

import java.io.BufferedWriter;
import java.io.FileInputStream;
import java.io.FileOutputStream;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.util.Arrays;
import java.util.Scanner;

public class B {

	/**
	 * @param args
	 * @throws IOException
	 */
	public static void main(String[] args) throws IOException {
		// BufferedReader read = new BufferedReader(new InputStreamReader(
		// new FileInputStream(
		// "C:/Users/Ortiga/Downloads/B-small-attempt0.in")));

		BufferedWriter write = new BufferedWriter(new OutputStreamWriter(
				new FileOutputStream("C:/Users/Ortiga/Downloads/outputB.txt")));
		Scanner sc = new Scanner(new InputStreamReader(new FileInputStream(
				"C:/Users/Ortiga/Downloads/B-small-attempt1.in")));
		byte length = sc.nextByte();
		for (byte i = 0; i < length; i++) {
			byte t = sc.nextByte(), s = sc.nextByte(), p = sc.nextByte(), max = 0, getDuringSurp = 0;
			String rit = "Case #" + (i + 1) + ": ";
			byte[] t_i = new byte[t];
			for (byte j = 0; j < t; j++)
				t_i[j] = sc.nextByte();
			Arrays.sort(t_i);
			int sCounter = 0;
			for (byte j = 0; j < t; j++) {
				byte currT_i = t_i[j];
				if (currT_i == 0 && p > 0)
					continue;
				if (sCounter < s) {
					if ((currT_i - 2) % 3 == 0) {
						if ((((currT_i - 2) / 3) + 2 >= p)) {
							max++;
							getDuringSurp++;
						}
						sCounter++;
						continue;
					} else if ((currT_i - 3) % 3 == 0) {
						if ((((currT_i - 3) / 3) + 2 >= p)) {
							max++;
							getDuringSurp++;
						}
						sCounter++;
						continue;
					}
				}
				if ((currT_i - 1) % 3 == 0) {
					if ((((currT_i - 1) / 3) + 1 >= p))
						max++;
					else if (currT_i + 4 / 3 >= p && getDuringSurp < sCounter) {
						sCounter--;
						j--;
					}
				} else if ((currT_i - 2) % 3 == 0) {
					if ((((currT_i - 2) / 3) + 1 >= p))
						max++;
					else if (currT_i + 4 / 3 >= p && getDuringSurp < sCounter) {
						sCounter--;
						j--;
					}
				} else {
					if (currT_i / 3 >= p)
						max++;
					else if (currT_i + 4 / 3 >= p && getDuringSurp < sCounter) {
						sCounter--;
						j--;
					}
				}
			}
			rit += max;
			write.write(rit);
			if (i < length - 1)
				write.newLine();
		}
		sc.close();
		write.close();
	}
}
