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 Googlers {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int cases = sc.nextInt();
		for (int x = 0; x < cases; x++) {
			sc.nextLine();
			int n = sc.nextInt();
			int s = sc.nextInt();
			int p = sc.nextInt();
			int posibles = 0;
			for (int i = 0; i < n; i++) {
				int ti = sc.nextInt();
				if (ti < p)
					continue;
				//if (ti == 3 * p || ti == 3 * p - 1 || ti == 3 * p - 2)
				if (ti >= 3 * p - 2)
					posibles++;
				else if (s > 0 && (ti >= 3 * p - 4)) {
					posibles++;
					s--;
				}
			}
			System.out.println("Case #" + (x+1) + ": " + posibles);
		}
	}
}
