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

public class Main {
    public static void main(String[] args) {
        try {
            Scanner in = new Scanner(new FileReader("in.txt"));
            PrintWriter out = new PrintWriter(new FileWriter("out.txt"), true);

            int t = in.nextInt();

            for (int i = 1; i <= t; i++) {
                int res = 0;
                int n = in.nextInt();
                int s = in.nextInt();
                int p = in.nextInt();
                int tt[] = new int[n];
                for (int j = 0; j < n; j++) {
                    tt[j] = in.nextInt();
                }
                if (p == 0) {
                    res = n;
                } else {
                    int min = 3 * p - 2;
                    for (int j = 0; j < n; j++) {
                        if (min <= tt[j]) res++;
                    }
                    int ttt[] = new int[n - res];
                    int itr = 0;
                    for (int j = 0; j < n; j++) {
                        if (min > tt[j]) ttt[itr++] = tt[j];
                    }
                    int minCrazy = 3 * p - 5;
                    int ress = 0;
                    for (int j = 0; j < itr; j++) {
                        if (minCrazy <= ttt[j] && ttt[j] != 0) ress++;
                    }
                    if (ress <= s) {
                        res += ress;
                    } else {
                        res += s;
                    }
                }

                out.println("Case #" + i + ": " + res);
            }
        } catch (Exception e) {
            e.printStackTrace();
        }
    }
}