import java.util.List;


public class Case implements Runnable {

	private int id;
	private String output;

	private int n;
	private int s;
	private int p;
	private List<Integer> g;

	public Case(int id) {
		this.id = id;
	}

	public Case(int id, int n, int s, int p, List<Integer> g) {
		super();
		this.id = id;
		this.n = n;
		this.s = s;
		this.p = p;
		this.g = g;
	}

	public String solve() {
		int res = 0;
		for (int googler : g) {
			int b = googler / 3;
			boolean div = googler % 3 == 0;
			if (b >= p) {
				res++;
				continue;
			}
			if (p == b+1) {
				if (div && s > 0 && b > 0) {
					res++;
					s--;
					continue;
				}
				if (!div) {
					res++;
					continue;
				}
			}
			if (p == b+2) {
				if (3*b+2 == googler && s > 0) {
					res++;
					s--;
				}
			}
		}
		return String.valueOf(res);
	}

	@Override
	public void run() {
		output = solve();
	}

	@Override
	public String toString() {
		return "Case #" + id + ": " + output;
	}

}
import java.util.Arrays;
import java.util.Scanner;


public class Q2 {
    
    public static void main(String[] args) {
        Scanner s = new Scanner(System.in);
        int T = s.nextInt();
        for (int i = 0; i < T; i++) {
            int N = s.nextInt();
            int S = s.nextInt();
            int P = s.nextInt();
            int[] scores = new int[N];
            for (int j = 0; j < N; j++) {
                scores[j] = s.nextInt();
            }
            System.out.println("Case #" + (i + 1) + ": " + numAboveMax(scores, S, P));
        }
    }

    private static int numAboveMax(int[] scores, int S, int P) {
        Arrays.sort(scores);
        int surprises = 0;
        int result = 0;
        if (P > 1) {
            for (int i = scores.length - 1; i >= 0; i--) {
                if (scores[i] > (3 * P - 3)) {
                    result++;
                } else if ((scores[i] > (3 * P - 5)) && (surprises < S)) {
                    result++;
                    surprises++;
                }
            }
            return result;
        } else if (P == 1) {
            for (int i = scores.length - 1; i >= 0; i--) {
                if (scores[i] > 0) {
                    result++;
                }
            }
            return result;
        } else {
            return scores.length;
        }
    }
}
