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.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.util.StringTokenizer;


public class dancers {

	/**
	 * @param args
	 */
	public static void main(String[] args) throws IOException
	{
		// TODO Auto-generated method stub
		BufferedReader br = new BufferedReader(new FileReader("problem.in"));
		int t = Integer.parseInt(br.readLine());
		for (int i = 1; i <= t; i++)
		{
			String line = br.readLine();
			StringTokenizer st = new StringTokenizer(line, " ");
			int len = Integer.parseInt(st.nextToken());
			int surp = Integer.parseInt(st.nextToken());
			int want = Integer.parseInt(st.nextToken());
			int count = 0;
			int[] vals = new int[len];
			for (int j = 0; j < len; j++)
			{
				vals[j] = Integer.parseInt(st.nextToken());
			}
			for (int k: vals)
			{
				k -= want;
				if (k <0)
					continue;
				else
				{
					if (k >= 2 * want - 2)
					{
						count++;
					}
					else if (k >= 2 * want - 4)
					{
						if (surp == 0)
							continue;
						else
						{
							surp--;
							count++;
						}
					}
				}
			}
			System.out.println("Case #" + i + ": " + count);
			
		}
	}

}
