/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

/*
 * Dancing
 * Jason Bradley Nel
 * 16287398
 */
import java.io.*;

public class Dancing {

    public static void main(String[] args) {

        In input = new In("input.txt");
        int T = Integer.parseInt(input.readLine());

        for (int i = 0; i < T; i++) {
            System.out.printf("Case #%d: ", i + 1);
            int N = input.readInt();
            int s = input.readInt();
            int p = input.readInt();
            int c = 0;//counter for >=p cases
            //System.out.printf("N: %d, S: %d, P: %d, R: ", N, s, p);
            
            for (int j = 0; j < N; j++) {
                
                int score = input.readInt();
                int q = score / 3;
                int m = score % 3;
                //System.out.printf("%2d (%d, %d) ", scores[j], q, m);
                                
                switch (m) {
                    case 0:
                        if (q >= p) {
                            c++;
                        } else if (((q + 1) == p) && (s > 0) && (q != 0)) {
                            c++;
                            s--;
                        }
                        break;
                    case 1:
                        if (q >= p) {
                            c++;
                        } else if ((q + 1) == p) {
                            c++;
                        }
                        break;
                    case 2:
                        if (q >= p) {
                            c++;
                        } else if ((q + 1) == p) {
                            c++;
                        } else if (((q + 2) == p) && (s > 0)) {
                            c++;
                            s--;
                        }
                        break;
                }
            }
            //System.out.printf("Best result of %d or higher: ", p);
            System.out.println(c);
        }


    }
}

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();
        }
}