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

import java.util.Arrays;
import java.util.Scanner;

public class DancingWithTheGooglers {

	public static void main(String[] args) {
		new DancingWithTheGooglers().run();
	}

	private void run() {
		Scanner sc = new Scanner(System.in);
		int T = sc.nextInt();
		for (int testcase = 0; testcase < T; testcase++) {
			int N = sc.nextInt();
			int S = sc.nextInt();
			int p = sc.nextInt();
			int[] t = new int[N];
			for (int i = 0; i < N; i++) {
				t[i] = sc.nextInt();
			}
			int result = solve(N, S, p, t);
			System.out.printf("Case #%d: %d\n", testcase + 1, result);
		}
	}

	/**
	 * 
	 * @param N the number of Googlers
	 * @param S the number of surprising triplets of scores
	 * @param p
	 * @param t
	 * @return
	 */
	public int solve(int N, int S, int p, int[] t) {
		int result = 0;
		Arrays.sort(t);
		for (int i = N - 1; i >= 0; i--) {
			int b = (t[i] + 2) / 3;
			if (b >= p) {
				result++;
//				System.out.printf("(1) %d : %d\n", t[i], b);
			} else if (t[i] > 1 && S > 0 && b == p - 1 && ((t[i] - 1) % 3) != 0) {
				result++;
				S--;
//				System.out.printf("(2) %d : %d (S=%d)\n", t[i], b, S);
			}
		}
		return result;
	}

}
