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 ProblemB {
	static Scanner in = new Scanner(System.in);
	
	public static void main(String[] args) throws Exception{
		int lineCount = Integer.valueOf(in.nextLine());
		int[] lines = new int[lineCount];
		
		for(int n = 0; n < lineCount; n++) {
			int N = in.nextInt(), 
				S = in.nextInt(), 
				p = in.nextInt();
			
			int max = 0;
			
			for (int i = 0; i < N; i++) {
				int score= in.nextInt();
				int single = score / 3;
				
				switch (score % 3) {
				case 0:
					if (single >= p) {
						max++;
					} else {
						if (S > 0 && score >= 2 && score <= 28 && single + 1 >= p) {
							max++;
							S--;
						}
					}
					break;
				case 1:
					if (single + 1 >= p) {
						max++;
					}
					break;
				case 2:
					if (single +1 >= p) {
						max++;
					} else {
						if (S > 0 && score >= 2 && score <= 28 && single + 2 >= p) {
							max++;
							S--;
						}
					}
				}
			}
			
			lines[n] = max;
			
			in.nextLine();
		}
		
		for(int i = 1; i <= lineCount; i++) {
			System.out.println("Case #" + i + ": " + lines[i-1]);
		}
	}
}