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 qual;

import java.util.Arrays;
import java.util.Scanner;

public class DancingWithTheGooglers {

	public static void main(String[] args) {
		new DancingWithTheGooglers().run();
	}

	private void run() {
		Scanner sc = new Scanner(System.in);
		int T = sc.nextInt();
		for (int testcase = 0; testcase < T; testcase++) {
			int N = sc.nextInt();
			int S = sc.nextInt();
			int p = sc.nextInt();
			int[] t = new int[N];
			for (int i = 0; i < N; i++) {
				t[i] = sc.nextInt();
			}
			int result = solve(N, S, p, t);
			System.out.printf("Case #%d: %d\n", testcase + 1, result);
		}
	}

	/**
	 * 
	 * @param N the number of Googlers
	 * @param S the number of surprising triplets of scores
	 * @param p
	 * @param t
	 * @return
	 */
	public int solve(int N, int S, int p, int[] t) {
		int result = 0;
		Arrays.sort(t);
		for (int i = N - 1; i >= 0; i--) {
			int b = (t[i] + 2) / 3;
			if (b >= p) {
				result++;
//				System.out.printf("(1) %d : %d\n", t[i], b);
			} else if (t[i] > 1 && S > 0 && b == p - 1 && ((t[i] - 1) % 3) != 0) {
				result++;
				S--;
//				System.out.printf("(2) %d : %d (S=%d)\n", t[i], b, S);
			}
		}
		return result;
	}

}
