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.File;
import java.util.Arrays;
import java.util.Scanner;

public class DancingWiththeGooglers {

    public static void main(String[] args) throws Exception {

        File inp = new File("B-small-attempt0.in");
        Scanner sc = new Scanner(inp);

        int T = sc.nextInt();


        int result, n, s, p;

        for (int i = 0; i < T; i++) {

            n = sc.nextInt();
            s = sc.nextInt();
            p = sc.nextInt();

            int[] q = new int[n];

            for (int lop = 0; lop < n; lop++) {
                q[lop] = sc.nextInt();
            }


            result = dowork(n, s, p, q);

            System.out.println("Case #" + (i + 1) + ": " + result);



        }




    }

    private static int dowork(int n, int s, int p, int[] q) {
        int r = 0;

        Arrays.sort(q);

        int minSumWithoutSur = p * 3 - 2;
        int minSumWithSur = p * 3 - 4;
        
        minSumWithSur = (minSumWithSur >= 0)? minSumWithSur : 0 ;
        

        for (int i = q.length - 1; i >= 0; i--) {
            if (q[i] >= minSumWithoutSur) {
                r++;
            } else if ((q[i] >= minSumWithSur) && (q[i] != 0) && (s > 0)) {
                r++;
                s--;
            }
        }


        return r;
    }
}
