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

package R0;

import java.util.HashMap;
import java.util.Scanner;

/**
 *
 * @author Rohit
 */
public class QB {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
        Scanner s = new Scanner(System.in);
        int Tcases = s.nextInt();
        s.nextLine();
        for (int i = 0; i < Tcases; i++) {
            int Ngooglers = s.nextInt();
            int Ssurprising = s.nextInt();
            int Paim = s.nextInt();
            int score[] = new int[Ngooglers];
            for (int j = 0; j < Ngooglers; j++) {
                score[j] = s.nextInt();
            }
            /*
             * if score is <2, surprisingNotPossible,
             * if score is >=2 and <3*Paim - 4 surprisingPossible but bestNotPossible
             * if score is >=3*Paim-4 and <3*Paim-2 bestPossible only using surprising
             * if score is >=3*Paim-2 and <29 bestPossible and surprisingPossible
             * if score is >=29 bestPossible and surprisingNotPossible
             */
            int maxBest = 0;
            if (Paim == 0) {
                maxBest = Ngooglers;
            }
            if (Paim == 1) {
                for (int j = 0; j < Ngooglers; j++) {
                    if (score[j] >= 1) {
                        maxBest++;
                    }
                }
            }
            if (Paim > 1) {
                for (int j = 0; j < Ngooglers; j++) {
                    if (score[j] >= 3 * Paim - 4) {
                        if (score[j] < 3 * Paim - 2) {
                            if (Ssurprising > 0) {
                                maxBest++;
                                Ssurprising--;
                            }
                        } else {
                            maxBest++;
                        }
                    }
                }
            }
            //printing the output
            System.out.println("Case #" + (i + 1) + ": " + maxBest);

        }
    }
}
