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


// library In.java at http://introcs.cs.princeton.edu/stdlib/stdlib.jar

public class PB {
    public static void main (String[] args) {
        int t, n, s, p;
        
        int num, mod, quot;
        int maybe;
        int counter;
        int max;
        
        In in = new In("input.txt");
        t = Integer.parseInt(in.readLine());
        
        int i = 1;
        // get input
        while (in.hasNextLine()) {
            maybe = 0;
            counter = 0;
            n = in.readInt();
            s = in.readInt();
            p = in.readInt();
            
            for (int j = 0; j < n; j++) {
                num = in.readInt();
                quot = num / 3;
                mod = num % 3;

                if (mod == 1) {
                    if (quot + 1 >= p) {
                        counter++;
                        continue;
                    }
                    if (3 * p - 2 <= num) {
                        maybe++;
                        continue;
                    }
                }
                if (mod == 0){ 
                    if (quot >= p) {
                        counter++;
                        continue;
                    }
                    if (3 * p - 3 <= num && num != 0) {
                        maybe++;
                        continue;
                    }
                }
                if (mod == 2) {
                    if (quot + 1 >= p) {
                        counter++;
                        continue;
                    }
                    if (3 * p - 4 <= num) {
                        maybe++;
                        continue;
                    }
                }
            }
            max = Math.min(s, maybe);
            
            System.out.print("Case #" + i + ": " + (max + counter) + "\n");
            i++;
        }
    }
}
