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.BufferedReader;
import java.io.File;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Scanner;
import java.util.StringTokenizer;
 
public class habala {
        public static void main(String[] args) throws Exception {
        	
        	
        	String s2;
        	
        	
                BufferedReader in = new BufferedReader(new InputStreamReader(new FileInputStream("input.in")));
                PrintWriter out = new PrintWriter("output.out");
               
                int testCases = Integer.parseInt(in.readLine());
                
                for (int i = 1; i <= testCases; i++) {
                        String s = in.readLine();
                        
                        int Googlers, surprizes ,p;
                        int winers = 0;
					      StringTokenizer st = new StringTokenizer (s);
					      s2 = "";
					
					      s2 = st.nextToken();
					      Googlers = Integer.parseInt(s2);
					      surprizes  = Integer.parseInt(st.nextToken());
					      p = Integer.parseInt(st.nextToken());
					      
					      int minn = (3*p-2) < p ? p : (3*p-2) ;
					      int mins = (3*p-4) < p? p : (3*p-4) ;
					      
					     for(int j = 1 ; j <= Googlers ; j++)
						 {
					         
					           int scoure = Integer.parseInt(st.nextToken());
					           if (scoure >= minn )
					        	   winers++;
					           else if(scoure >= mins && surprizes > 0){
					        	   winers++;
					        	   surprizes--;
					           }
					       
					         
						}
                        
                        out.println("Case #"+i+": "+winers);
                        
                }
                out.close();
                in.close();
        }
}