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.security.AlgorithmConstraints;
import java.util.Scanner;
import java.util.StringTokenizer;


public class Numbers {

	static int count =0;
	static int max;
	static int surprise;
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner sc = new Scanner(System.in);
		int testCases = Integer.parseInt(sc.nextLine().trim());
		for(int i=1;i<=testCases;i++){
			String line = sc.nextLine();
			StringTokenizer st = new StringTokenizer(line);
			int persons = Integer.parseInt(st.nextToken());
			surprise = Integer.parseInt(st.nextToken());
			max = Integer.parseInt(st.nextToken());
			count =0;
			if(max == 0){
				System.out.println("Case #"+i+": "+persons);
			}else{
				for(int j=0;j<persons;j++){
					algorithm(Integer.parseInt(st.nextToken()));
				}
				System.out.println("Case #"+i+": "+count);
				}
		}

	}
	public static void algorithm(int current){
		if(current ==0){
			return;
		}
		int div = current/3;
		if(current%3==0){
			if(div >=max){
				count++;
			}else if(surprise>0 && (div+1) >=max){
				count++;
				surprise--;
			}
		}else if(current%3==1){
			if((div+1) >=max){
				count++;
			} 
		}else if(current%3==2){
			if((div+1) >=max) count++;
			else if(surprise>0 && (div+2)>=max){
				count++;
				surprise--;
			}
		}
	}

}
