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;

/*
 * Google Code Jam 2012
 * Program by Tommy Ludwig
 * Problem: Dancing With the Googlers
 * Date: 2012-04-13
 */


public class dancing {
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int T, N, S, p;
		T = in.nextInt();
		
		for (int i = 1; i <= T; i++) {
			int y = 0;
			N = in.nextInt();
			S = in.nextInt();
			p = in.nextInt();
			int [] t = new int[N];
			
			for (int j = 0; j < N; j++) 
				t[j] = in.nextInt();
			
			//minimum number with surprise case
			int minNumS = (3 * p) - 4;
			if (minNumS < 2) minNumS = 2;
			//minimum number without surprise case
			int minNum = (3 * p) - 2;
			//if (minNum < 0) minNum = 0;
			
			for (int j = 0; j < N; j++) {
				if (t[j] >= minNum)
					y++;
				else if (t[j] >= minNumS && S > 0) {
					y++;
					S--;
				}
			}
			System.out.printf("Case #%d: %d\n", i, y);
		}
	}

}
