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


public class GCJ2012QA
{

    public static void main(String[] args) throws Exception
    {
        Scanner sc = new Scanner(new FileReader("A-input.txt"));
        PrintWriter pw = new PrintWriter(new FileWriter("A-output.txt"));
        
        final int CASE_COUNT = sc.nextInt();
        for(int caseNum = 1; caseNum<= CASE_COUNT; caseNum++){
            pw.print("Case #" + caseNum + ": ");
            //HERE WE SOLVE STUFF
            int ans = 0;
            
            int N = sc.nextInt();
            int S = sc.nextInt();
            int sp = sc.nextInt();
            for(int i =0; i<N; i++){
                int score = sc.nextInt();
                int kk = score % 3;
                int base = (score - kk)/3;
                
                if(base >= sp){
                    ans++;
                } else if( kk > 0 && (base + 1) >= sp && (base - 1) >= 0){
                    ans++;
                } else if(S>0) {
                    if(kk == 0 && (base+2) >= sp && (base - 1) >= 0){
                        ans++;
                        S--;
                    }
                    if(kk == 1 && (base+2) >= sp && (base - 1) >= 0){
                        ans++;
                        S--;
                    }
                    if(kk == 2 && (base+2) >= sp){
                        ans++;
                        S--;
                    }
                }
                 
            }
            
            //PUT ANSWER HERE
            pw.println(ans);
        }
        
        pw.flush();
        pw.close();
        sc.close();
    }

    
}
