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

import java.util.Scanner;

public class DWG {

	/**
	 * @param args
	 */
	public static void main(String[] args) {

		Scanner sc = new Scanner(System.in);
		int t = sc.nextInt();
		for (int _t = 0; _t < t; _t++) {
			
			int n = sc.nextInt();
			int s = sc.nextInt();
			int p = sc.nextInt();
			
			int floor, sfloor;
			if (p == 0){
				floor = 0;
			} else {
				floor = p+(2*(p-1));
			}
			if (p == 1){
				 sfloor = 1;
			} else {
				sfloor = p+(2*(p-2));
			}

			int y = 0;
			for (int _n=0; _n<n; _n++){
				int ti = sc.nextInt();
				if (ti >= floor) {
					y++;
				} else if (ti >= sfloor && s > 0 && sfloor >= 0) {
					y++;
					s--;
				}
			}
			

			System.out.printf("Case #%d: %d\n",_t+1,y);
		}
	}

}
