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

import java.io.*;
import java.util.Scanner;

public class DancingWithTheGooglers {


    public static void main(String[] args) throws Exception {
        Scanner scanner = new Scanner(new BufferedInputStream(new FileInputStream("/Users/taobo2/Downloads/B-large.in.txt")));
        Writer output = new BufferedWriter(new FileWriter("B-large.output-b.txt"));

        int T = scanner.nextInt();
        for (int i = 1; i <= T; ++i) {
            int N = scanner.nextInt();
            int[] total = new int[N];
            int s = scanner.nextInt();
            int p = scanner.nextInt();
            for (int j = 0; j < N; ++j) {
                total[j] = scanner.nextInt();
            }
            output.write("Case #" + i + ": " + sovle(total, p, s));
            output.write(System.getProperty("line.separator"));
        }
        output.close();
        scanner.close();
    }


    public static int sovle(int[] total, int p, int s) {
        int ret = 0;
        for (int t : total) {
            int mod = t % 3;
            switch (mod) {
                case 0:
                    if (t / 3 >= p) ret++;
                    else if (s > 0) {
                        int smallest = (t - 3) / 3;
                        if (smallest < 0) {
                            break;
                        }
                        if (smallest + 2 >= p) {
                            s--;
                            ret++;
                        }
                    }
                    break;

                case 1:
                    if ((t - 1) / 3 + 1 >= p) ret++;
                    else if (s > 0) {
                        int smallest = (t - 4) / 3;
                        if (smallest < 0) {
                            break;
                        }
                        if (smallest + 2 >= p) {
                            ret++;
                            s--;
                        }
                    }
                    break;

                case 2:
                    if ((t - 2) / 3 + 1 >= p) ret++;
                    else if (s > 0) {
                        int smallest = (t - 2) / 3;
                        if (smallest < 0) {
                            break;
                        }

                        if (smallest + 2 >= p) {
                            ret++;
                            s--;
                        }
                    }
                    break;
            }
        }
        return ret;
    }
}
