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

public class B {

    public static void main(String args[]) throws Exception {
        final String PATH = "/home/goalboy/software installation/codejam-commandline-1.0-beta4/source/";
        final String FILE = "B-small-0";
        Scanner in = new Scanner(new File(PATH + FILE + ".in"));
        PrintWriter out = new PrintWriter(PATH + FILE + ".out");

        int test = in.nextInt();
        for (int t = 1; t <= test; t++) {
            int N = in.nextInt();
            int S = in.nextInt();
            int p = in.nextInt();
            int totals[] = new int[N];
            int bests[] = new int[N];
            boolean addables[] = new boolean[N];
            for (int i = 0; i < N; i++) {
                totals[i] = in.nextInt();
            }
            Arrays.sort(totals);
            for (int i = 0; i < N; i++) {
                if (totals[i] % 3 == 0) {
                    bests[i] = totals[i] / 3;
                    addables[i] = (bests[i] > 0);
                } else if (totals[i] % 3 == 1) {
                    bests[i] = totals[i] / 3 + 1;
                    addables[i] = false;
                } else {
                    bests[i] = totals[i] / 3 + 1;
                    addables[i] = (bests[i] > 0);
                }
            }
            int result = 0;
            for (int i = N - 1; i >= 0; i--) {
                if (bests[i] >= p) {
                    result++;
                } else if (addables[i] && bests[i] + 1 >= p && S > 0) {
                    result++;
                    S--;
                }
            }
            out.println("Case #" + t + ": " + result);
        }

        out.close();
    }
}
