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

public class ProblemB {

	public static void main(String[] args) throws FileNotFoundException {
		start();
	}

	public static void start() throws FileNotFoundException {
		File file = new File("./");
		String name = "";
		for (File f : file.listFiles()) {
			if (f.getName().endsWith(".in")) {
				name = f.getName().replaceFirst("\\.in", "");
				break;
			}
		}
		Scanner in = new Scanner(new File(name + ".in"));
		PrintWriter out = new PrintWriter(new File(name + ".out"));
		new Solution(in, out);
		out.close();
	}

	public static class Solution {

		public Solution(Scanner in, PrintWriter out) {
			int cases = in.nextInt();
			in.nextLine();
			for (int i = 1; i <= cases; i++) {
				String answer = "Case #" + i + ": " + compute(in.nextLine());
				out.println(answer);
				System.out.println(answer);
			}
		}

		private int compute(String s) {
			Scanner sc = new Scanner(s);
			int googlers = sc.nextInt();
			int surprizing = sc.nextInt();
			int points = sc.nextInt();
			int answer = 0;
			for (int i = 0; i < googlers; i++) {
				int thisPoint = sc.nextInt();
				int guaranteedWin = points * 3 - 2;
				int possibleWin = points * 3 - 4;

				if (thisPoint == 0) {
					if (points == 0) {
						answer++;
					}
				} else if (thisPoint == 1) {
					if (points == 0 || points == 1) {
						answer++;
					} else if (points == 2 && surprizing > 0) {
						surprizing--;
						answer++;
					}
				} else if (thisPoint >= guaranteedWin) {
					answer++;
				} else if (thisPoint >= possibleWin && surprizing > 0) {
					surprizing--;
					answer++;
				}
			}
			return answer;
		}
	}
}
