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.io.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.Scanner;

public class B_DancingWiththeGooglers {
	public static void main(String[] args) throws FileNotFoundException {
		Scanner sc = new Scanner(new File("file1.in"));
		PrintWriter writer = new PrintWriter(new File("file1.out"));
		int t = sc.nextInt();
		for (int i = 1; i <= t; i++) {
			int n = sc.nextInt();
			int s = sc.nextInt();
			int p = sc.nextInt();
			int[] a = new int[n];
			for (int j = 0; j < n; j++)
				a[j] = sc.nextInt();

			int min1 = p - 1 + p - 1 + p;
			int min2 = p - 2 + p - 1 + p - 1;
			int count = 0;
			for (int j = 0; j < n; j++)
				if (a[j] >= p) {
					if (a[j] >= min1)
						count++;
					else {
						if (a[j] >= min2 && s > 0) {
							s--;
							count++;
						}
					}
				}
			writer.println("Case #" + i + ": " + count);
		}
		writer.close();
	}
}
