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.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.Scanner;

public class QuestionB {

	public static void main(String[] args) throws IOException {
		Scanner sc = new Scanner(new FileReader("B-large.in"));
		PrintWriter pw = new PrintWriter(new FileWriter("output.txt"));

		int t = sc.nextInt(); // number of test cases

		for (int i = 0; i < t; i++) {
			pw.print("Case #" + (i + 1) + ": ");
			System.out.print("Case #" + (i + 1) + ": ");
			int n = sc.nextInt(); // number of Googlers
			int s = sc.nextInt(); // number of surprising scores
			int p = sc.nextInt(); // min score for best result

			int count = 0;
			for (int j = 0; j < n; j++) {
				int target = sc.nextInt();
				if (target < p)
					continue;
				int temp = target / 3;
				if (temp + temp + temp == target && temp >= p) {
					count++;
					continue;
				}
				if (temp + temp + (temp - 1) == target && temp >= p) {
					count++;
					continue;
				}
				if (temp + temp + (temp + 1) == target && temp + 1 >= p) {
					count++;
					continue;
				}
				if (temp + (temp - 1) + (temp - 1) == target && temp >= p) {
					count++;
					continue;
				}
				if (temp + (temp + 1) + (temp + 1) == target && temp + 1 >= p) {
					count++;
					continue;
				}
				if (s > 0) {
					if (temp + (temp + 1) + (temp + 2) == target
							&& temp + 1 >= p) {
						count++;
						s--;
						continue;
					}
					if (temp + (temp - 1) + (temp - 2) == target && temp >= p) {
						count++;
						s--;
						continue;
					}
					if (temp + temp + (temp + 2) == target && temp + 2 >= p) {
						count++;
						s--;
						continue;
					}
					if (temp + temp + (temp - 2) == target && temp >= p) {
						count++;
						s--;
						continue;
					}
					if (temp + (temp + 2) + (temp + 2) == target
							&& temp + 2 >= p) {
						count++;
						s--;
						continue;
					}
					if (temp + (temp - 2) + (temp - 2) == target && temp >= p) {
						count++;
						s--;
						continue;
					}
					if (temp + (temp - 1) + (temp + 1) == target
							&& temp + 1 >= p) {
						count++;
						s--;
						continue;
					}
				}
			}
			pw.print(count + "\n");
			System.out.println(count);
		}
		pw.flush();
		pw.close();
		sc.close();
	}

}
