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 B {
	public static void main(String args[]) {
		new B();
	}

	public B() {
		Scanner in = new Scanner(System.in);

		int T = in.nextInt();
		for(int t=1; t<=T; t++) {
			int N = in.nextInt();
			int S = in.nextInt();
			int p = in.nextInt();

			int y = 0;
			for(int n=0; n<N; n++) {
				int ti = in.nextInt();

				int r = ti - p;
				if(r < 0) continue;

				int a = r / 2;
				int b = r - a;

				int da = a - p;
				int db = b - p;
				int d = Math.min(da, db);
				if(d == -2) {
					if(S > 0) S--;
					else continue;
				}

				if(d >= -2) y++;
			}
			System.out.printf("Case #%d: %d\n", t, y);
		}
	}
}