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.*;
public class Main
{
	public static void main(String[]args)
	{
		Scanner in = new Scanner(System.in);
		int inputs = in.nextInt();
		for(int i = 1; i <= inputs; i++)
		{
			int ppls = in.nextInt();
			int sup = in.nextInt();
			int score = in.nextInt();
			int count = 0;
			int scount = 0;
			for(int j = 0; j < ppls; j++)
			{
				int k = in.nextInt();
				if(k >= score + (Math.max(0, score-1)*2)) count++;
				else if(k >= score + (Math.max(0, score-2)*2)) scount++;
			}
			count += Math.min(scount, sup);
			System.out.println("Case #" + i + ": " +count);
		}
	}

}
