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.util.Scanner;

public class B {

	private static Scanner in = new Scanner(System.in);

	private static void solve(int no) {
		int N = in.nextInt();
		int S = in.nextInt();
		int p = in.nextInt();

		int ans = 0;
		for (int i = 0; i < N; i++) {
			int sum = in.nextInt();
			int avr = sum / 3;
			int rem = sum % 3;
			switch (rem) {
			case 0:
				if (avr >= p) {
					ans++;
				} else if (S > 0 && avr > 0 && avr + 1 >= p) {
					ans++;
					S--;
				}
				break;
			case 1:
				if (avr + 1 >= p) {
					ans++;
				}
				break;
			case 2:
				if (avr + 1 >= p) {
					ans++;
				} else if (S > 0 && avr + 2 >= p) {
					ans++;
					S--;
				}
				break;
			}
		}
		System.out.printf("Case #%d: %d%n", no, ans);
	}

	public static void main(String[] args) {
		int T = in.nextInt();
		for (int i = 0; i < T; i++) {
			solve(i + 1);
		}
	}

}
