import java.util.List;


public class Case implements Runnable {

	private int id;
	private String output;

	private int n;
	private int s;
	private int p;
	private List<Integer> g;

	public Case(int id) {
		this.id = id;
	}

	public Case(int id, int n, int s, int p, List<Integer> g) {
		super();
		this.id = id;
		this.n = n;
		this.s = s;
		this.p = p;
		this.g = g;
	}

	public String solve() {
		int res = 0;
		for (int googler : g) {
			int b = googler / 3;
			boolean div = googler % 3 == 0;
			if (b >= p) {
				res++;
				continue;
			}
			if (p == b+1) {
				if (div && s > 0 && b > 0) {
					res++;
					s--;
					continue;
				}
				if (!div) {
					res++;
					continue;
				}
			}
			if (p == b+2) {
				if (3*b+2 == googler && s > 0) {
					res++;
					s--;
				}
			}
		}
		return String.valueOf(res);
	}

	@Override
	public void run() {
		output = solve();
	}

	@Override
	public String toString() {
		return "Case #" + id + ": " + output;
	}

}
import java.io.BufferedWriter;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.Scanner;

public class G_2 {

    static int n, s, p;
    static int[] tt;

    public static void main(String[] args) throws IOException {
        PrintWriter bw = new PrintWriter(new FileWriter("1.txt"));
        Scanner scan = new Scanner(System.in);
        int t = scan.nextInt();
        scan.nextLine();
        for (int i = 0; i < t; i++) {
            n = scan.nextInt();
            s = scan.nextInt();
            p = scan.nextInt();
            tt = new int[n];
            int a = 3 * p - 4;
            if (p == 1) {
                a = 1;
            }
            if (p == 0) {
                a = 0;
            }
            // int b = 3 * p + 4;
            int c = 3 * p - 2;
            // int d = 3 * p + 2;
            int count = 0;

            for (int j = 0; j < n; ++j) {
                tt[j] = scan.nextInt();
                if (c <= tt[j]) {
                    count++;
                    continue;
                }
                if (a <= tt[j] && s != 0) {
                    s--;
                    count++;
                    continue;
                }
            }

            System.out.println(String.format("Case #%d: %d", (i + 1), count));
            bw.write(String.format("Case #%d: %d\n", (i + 1), count));
        }
        bw.flush();
        bw.close();
    }
}
