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.*;

public class B {
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);

		int T = in.nextInt();
		int N, S, p;

		for (int x = 1; x <= T; x++) {
			N = in.nextInt();
			S = in.nextInt();
			p = in.nextInt();

			int[] t = new int[N];
			int y = 0;

			for (int i = 0; i < N; i++) {
				t[i] = in.nextInt();

				int k = t[i] / 3;
				int j1 = -1, j2 = -1, j3 = -1;
 
				// not surprising triplets
				if ((k + 1) + (k + 1) + k == t[i]) {
					j1 = k + 1;
					j2 = k + 1;
					j3 = k;
				}

				else if ((k + 1) + k + k == t[i]) {
					j1 = k + 1;
					j2 = k;
					j3 = k;
				}

				else if (3 * k == t[i]) {
					j1 = k;
					j2 = k;
					j3 = k;
				}

				if (j1 >= p || j2 >= p || j3 >= p) {
					y++;
					continue;
				}

				if(S==0) continue;
				
				// surprising triplets
				if (k != 9 && (k + 2) + k + k == t[i]) {
					j1 = k + 2;
					j2 = k;
					j3 = k;
				} else if (k != 0 && ((k + 1) + (k + 1) + (k - 1) == t[i])) {
					j1 = k + 1;
					j2 = k + 1;
					j3 = k - 1;
				} else if (k != 0 && ((k + 1) + k + (k - 1) == t[i])) {
					j1 = k + 1;
					j2 = k;
					j3 = k - 1;
				}
				
				if (j1 >= p || j2 >= p || j3 >= p) {
					y++;
					S--;
					continue;
				}

			}

			System.out.println("Case #" + x + ": " + y);
		}
	}
}
