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

public class Task {

	private int T;
	private int S;
	private int P;
	private int[] googlers;

	public Task(int t, int s, int p, int[] googlers) {
		super();
		T = t;
		S = s;
		P = p;
		this.googlers = googlers;
	}

	public String execute() {
		int result = 0;
		for (int googler : googlers) {
			int mod = googler % 3;
			int div = (googler - mod) / 3;
			if (googler != 0) {
				if (div >= P) {
					result++;
				} else if ((P - div) == 1 && mod >= 1) {
					result++;
				} else if ((P - div) == 2 && mod == 2 && S > 0) {
					S--;
					result++;
				} else if ((P - div) == 1 && mod == 0 && S > 0) {
					S--;
					result++;
				}
			} else {
				if(P == 0){
					result++;
				}
			}
		}
		return result + "";
	}

}
