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.util.Scanner;

public class GooglerDance {

	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int size = in.nextInt();
		int count = 0;
		while (count < size) {
			int maxNum = 0;
			int googlers = in.nextInt();
			int[][] judges = new int[googlers][3];
			int[] scores = new int[googlers];
			boolean[] ishigher = new boolean[googlers];
			int s = in.nextInt();
			int p = in.nextInt();
			for (int i = 0; i < scores.length; i++) {// getting scores
				scores[i] = in.nextInt();
			}
			// computing scores
			for (int i = 0; i < scores.length; i++) {
				int ceil = scores[i] / 3;
				if ((scores[i] % 3) > 0) {
					ceil++;
				}
				if (ceil >= p) {
					ishigher[i] = true;
					maxNum++;
				}
				if ((3 * ceil) == scores[i]) {
					judges[i][0] = ceil;
					judges[i][1] = ceil;
					judges[i][2] = ceil;
					if (!ishigher[i] && (p - ceil) == 1 && s > 0
							&& (ceil - 1) > 0) {
						judges[i][0] = ceil + 1;
						judges[i][1] = ceil;
						judges[i][2] = ceil - 1;
						maxNum++;
						s--;
					}
				} else if ((3 * ceil) == (scores[i] + 1)) {
					judges[i][0] = ceil;
					judges[i][1] = ceil;
					judges[i][2] = ceil - 1;
					if (!ishigher[i] && (p - ceil) == 1 && s > 0
							&& (ceil - 1) > 0) {
						judges[i][0] = ceil + 1;
						judges[i][1] = ceil - 1;
						judges[i][2] = ceil - 1;
						maxNum++;
						s--;
					}
				} else if ((3 * ceil) == (scores[i] + 2)) {
					judges[i][0] = ceil;
					judges[i][1] = ceil - 1;
					judges[i][2] = ceil - 1;

				} else {
					System.out.println("Error in Algorithm");
				}
			}
			System.out.format("Case #%d: %d\n", count + 1, maxNum);
			count++;
		}
	}
}
