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.IOException;
import java.io.RandomAccessFile;
import java.util.Arrays;


public class Dancing {


	public static void main(String[] args) throws IOException {
		RandomAccessFile in = new RandomAccessFile(new File("B-small-attempt0.in"), "r");
		RandomAccessFile out = new RandomAccessFile(new File("DanceOut.out"),"rw");
		int num = Integer.parseInt(in.readLine());
		for (int j = 1; j <= num; j++){
			int count = 0;
			String[] numbers = in.readLine().split(" ");
			int gs = Integer.parseInt(numbers[0]);
			int special = Integer.parseInt(numbers[1]);
			int over = Integer.parseInt(numbers[2]);
			int[] arr = new int[gs];
			for (int i = 3; i < numbers.length; i++) {
				arr[i-3] = Integer.parseInt(numbers[i]);
			}
			Arrays.sort(arr);
			for (int i = 0; i < gs; i++) {
				int base = arr[i]/3;
				switch(arr[i] % 3) {
					case 0:
						if (special > 0 && base > 0 && (base+1) >= over) {
								count++;
								special--;
						}
						else if(base >= over) {
							count++;
						}
						
						break;
					case 1:
						if(base >= over || (base+1) >= over) {
							count++;
						}
						break;
						
					case 2:
						if (special > 0 && (base + 2) >= over) {
				        		count++;
				        		special--;
				        }
						else if ((base + 1) >= over || base >= over) count++;
				        
						break;
				}
			}
			out.writeBytes("Case #" + j + ": " + count + "\n");
		}
	}

}
