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;
    }
}


package qualif2;

import java.io.File;
import java.util.Arrays;
import java.util.Scanner;

public class Qualif2 {

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

        Scanner scan = new Scanner(new File("input"));

        int num = Integer.parseInt(scan.nextLine());

        for (int i = 1; i <= num; i++) {
            int googlers = scan.nextInt();
            int surprising = scan.nextInt();
            int score = scan.nextInt();

            int[] totals = new int[googlers];

            for (int j = 0; j < googlers; j++) {
                totals[j] = scan.nextInt();
            }

            System.out.println("Case #" + i + ": " + solve(googlers, surprising, score, totals));
        }
    }

    private static int solve(int googlers, int surprising, int score, int[] totals) {
        Arrays.sort(totals);
        int count = 0;

        if (score == 0) {
            return googlers;
        }

        for (int i = totals.length - 1; i >= 0; i--) {
            int total = totals[i];
            if (total > 28) {
                count++;
                continue;
            }

            if (total == 0) {
                continue;
            }

            int base = total / 3;
            int r = total % 3;

            int n = base + (r > 0 ? 1 : 0);

            if (n >= score) {
                count++;
            } else if (surprising > 0) {
                surprising--;
                if (n + (r == 1 ? 0 : 1) >= score) {
                    count++;
                }
            } else {
                break;
            }
        }

        return count;
    }
}
