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


public class QualB {

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

		Scanner sc = new Scanner(new File("E:/inp.txt"));
		PrintWriter pr = new PrintWriter(new File("E:/out.txt"));
		int tc=sc.nextInt();
		int cnt=0;
		for(int i=1;i<=tc;i++){
			int n=sc.nextInt();
			int sup=sc.nextInt();
			int p=sc.nextInt();
			cnt=0;
			for(int j=1;j<=n;j++){
				int pt=sc.nextInt();
				if(pt==0){
					if(p==0)cnt++;
				}
				else if(pt!=0 && pt%3==0){
					int t=pt/3;
					if(p<=t){
						cnt++;
					}
					else if (sup>=1 && p-t==1){
						cnt++;
						sup--;
					}
				}
				else if(pt!=0 && pt%3!=0){
					int t=pt/3;
					if(p<=t+1){
						cnt++;
					}
					else if (sup>=1 && p-t==2){
						cnt++;
						sup--;
					}
				}
			}
			pr.printf("Case #%d: %d%n", i,cnt);
		}
		sc.close();
		pr.close();

	}
	
}
