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 ProbB1 {
	
	public static void main(String arg[]){
		
		Scanner in = new Scanner (System.in);
		
		int T= in.nextInt();
		
		for(int i=1;i<=T;i++){
			int N = in.nextInt();
			int S=in.nextInt();
			int p=in.nextInt();
			
			int count = 0;
			int minN = p*3-4;
			
			for(int j=0;j<N;j++){
				int n = in.nextInt();
				if(minN>=0){
				if(n>=minN+2)
					count++;
				else if((n>=minN)&&(S>0)){
					S--;
					count++;
				}
				}
				else{
					if((n>0)||((n==0)&&(p==0))) count ++ ;
				}
					
					}
			System.out.println("Case #"+i+": "+count);
					
			}
		}
	}


