import java.io.*;
import java.math.*;
import java.util.*;
import java.text.*;

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

        int T = sc.nextInt();

        for (int casenumber = 1; casenumber <= T; ++casenumber) {

            int n = sc.nextInt();
            int s = sc.nextInt();
            int p = sc.nextInt();

            int[] ts = new int[n];
            for (int i = 0; i < n; ++i)
                ts[i] = sc.nextInt();

            int thresh1 = (p == 1 ? 1 : (3 * p - 4));
            int thresh2 = (3 * p - 2);

            int count1 = 0, count2 = 0;

            for (int i = 0; i < n; ++i) {
                if (ts[i] >= thresh2) {
                    ++count2;
                    continue;
                }
                if (ts[i] >= thresh1) {
                    ++count1;
                }
            }

            if (count1 > s) {
                count1 = s;
            }

            System.out.format("Case #%d: %d%n", casenumber, count1 + count2);
        }
    }
}

package Qualification;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class DancingWithGooglers {
	public static void main(String[] args) throws NumberFormatException,
			IOException {
		BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
		int t = Integer.parseInt(in.readLine());
		for (int m = 1; m <= t; m++) {
			String[] S = in.readLine().split(" ");
			int n = Integer.parseInt(S[0]);
			int sur = Integer.parseInt(S[1]);
			int p = Integer.parseInt(S[2]);
			int[] A = new int[n];
			for (int i = 0; i < n; i++)
				A[i] = Integer.parseInt(S[i + 3]);
			int cnt = 0;
			for (int i = 0; i < n; i++)
				if (Math.ceil(A[i] / 3.0) >= p)
					cnt++;
				else if (A[i] >= p && p - (A[i] - p) / 2 == 2 && sur > 0) {
					sur--;
					cnt++;
				}
			System.out.println("Case #" + m + ": " + cnt);
		}
	}
}
