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

public class Solution {
	static int getGroup(int t, int p) {
		if (t >= 2) {
			if ((t + 1) / 3 + 1 < p) return 0;
			if ((t + 2) / 3 < p) return 1;
			return 2;
		} else if ((t + 2) / 3 >= p) return 3;
		return 4;
	}
	
	public static void main(String[] args) throws Exception {
		Scanner in = new Scanner(new File("B-small-attempt0.in"));
		PrintWriter out = new PrintWriter(new File("out.txt"));
		int T = in.nextInt();
		for (int tc = 1; tc <= T; tc++) {
			out.print("Case #" + tc + ": ");
			int n = in.nextInt(), s = in.nextInt(), p = in.nextInt();
			int cnt[] = new int[5];
			for (int i = 0; i < n; i++) {
				int t = in.nextInt();
				cnt[getGroup(t, p)]++;
			}
			int ans = cnt[3] + cnt[2] + Math.min(cnt[1], s);
			out.println(ans);
		}
		out.close();
	}

}
