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 DanceWGoogle {

	public static int testcase(int S, int p, int[] arr) {
		int over = 0;
		int oneund = 0;
		int temp;
		for (int i = 0; i < arr.length; i++) {
			temp=0;
			if (arr[i] % 3 == 0) {
				temp = arr[i] / 3;
			} else {
				temp = arr[i] / 3;
				temp++;
			}
			if (temp >= p)
				over++;
			else if (temp == p - 1 && arr[i]>1)
				oneund++;
		}
		over += Math.min(S, oneund);
		return over;
	}

	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		int T = scan.nextInt();
		int arr[];
		for (int i = 0; i < T; i++) {
			arr = new int[scan.nextInt()];
			int S = scan.nextInt();
			int p = scan.nextInt();
			for (int a = 0; a < arr.length; a++) {
				arr[a] = scan.nextInt();
			}
			System.out.println("Case #" + (i + 1) + ": " + testcase(S, p, arr));
		}
	}
}