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


public class B {

	static Scanner in = new Scanner(System.in);

	int solve() {
		int N = in.nextInt();
		int S = in.nextInt();
		int p = in.nextInt();
		
		int yesLimit = p + 2 * Math.max(0, p-1);
		int maybeLimit = p + 2 * Math.max(0, p-2);
		
		int yes = 0;
		int maybe = 0;

		for (int i=0; i<N; ++i) {
			int totalPoints = in.nextInt();
			if (totalPoints >= yesLimit) {
				++yes;
			} else if (totalPoints >= maybeLimit) {
				++maybe;
			}
		}
		
		return yes + Math.min(S, maybe);
	}
	
	
	public static void main(String[] args) {
		int T = in.nextInt();
		for (int i=1; i<=T; ++i) {
			int ans = new B().solve();
			System.out.println("Case #" + i + ": " + ans);
		}

	}

}
