import java.util.*;

public class B {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int T = sc.nextInt();
        B th = new B();
        for (int i = 0; i < T; i++) {
            int n = sc.nextInt();
            int s = sc.nextInt();
            int p = sc.nextInt();
            int[] t = new int[n];
            for (int j = 0; j < n; j++) {
                t[j] = sc.nextInt();
            }
            int c = th.getAnswer(s,p,t);
            System.out.println("Case #" + (i+1) + ": " + c);
        }
    }
    public int getAnswer(int s, int p, int[] t) {
        int A1 = p + p-1+p-1;
        int A2 = p + p-2+p-2;
        if (A1 < 0)
            A1 = 0;
        if (A2 < 0)
            A2 = 1;
        int remain = s;
        int count = 0;
        int n = t.length;
        for (int i = 0; i < n; i++) {
            if (t[i] >= A1) {
                count++;
            } else if (t[i] < A1 && t[i] >= A2) {
                if (remain > 0) {
                    remain--;
                    count++;
                }
            }
        }
        return count;
    }
}


import java.io.BufferedWriter;
import java.io.File;
import java.io.FileWriter;
import java.nio.Buffer;
import java.util.Arrays;
import java.util.Scanner;

public class DancingWithGooglers {

    public static void main(String[] args) throws Exception {
        BufferedWriter bufferedWriter = new BufferedWriter(new FileWriter("/home/xnike/Downloads/B-large.out"));
        Scanner scanner = new Scanner(new File("/home/xnike/Downloads/B-large.in"));

        int t = scanner.nextInt();
        scanner.nextLine();

        for (int i = 0; i < t; i++) {
            int n = scanner.nextInt(), s = scanner.nextInt(), p = scanner.nextInt();
            int[] ti = new int[n];

            for (int j = 0; j < n; j++) {
                ti[j] = scanner.nextInt();
            }
            scanner.nextLine();

            Arrays.sort(ti);

            int num = 0;
            for (int k = ti.length - 1; k > -1; k--) {
                int min = ti[k] / 3, max = ti[k] - 2 * (ti[k] / 3);

                if (0 == max - min && 2 < ti[k]) {
                    max++;
                    min--;
                }

                if (max >= p) {
                    if (max == p && (2 == max - min)) {
                        if (0 < s) {
                            s--;
                            num++;
                        }
                    } else {
                    num++;
                    }
                }
            }

            bufferedWriter.write("Case #" + (i + 1)  + ": " + num + "\n");
        }

        bufferedWriter.flush();
    }
}
