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.*;
public class Main {
	public static void main(String[] args) throws Exception{
		BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
		int cases=Integer.parseInt(in.readLine());
		for(int i=1;i<=cases;i++)
		{
			String line = in.readLine();
			String parts[] = line.split(" ");
			int out = 0;
			int n = Integer.parseInt(parts[0]);
			int s = Integer.parseInt(parts[1]);
			int p = Integer.parseInt(parts[2]);
			int count = 0;
			int marks[] = new int[n];
			for(int j=0;j<n; j++){
				marks[j] = Integer.parseInt(parts[3+j]);
			}
			if(p == 0){
				count = n;
				System.out.println("Case #"+i+": "+count);
				continue;
			}
			else{
				for(int j = 0 ; j < n ; j++){
					if(marks[j] != 0){
						if(marks[j] >= 3*p){
							count++;
							continue;
						}
						else if(marks[j] == ((3*p)-2)){
							count++;
							continue;
						}
						else if(marks[j] == ((3*p)-1)){
							count++;
							continue;
						}
						else if((marks[j] == ((3*p)-3) )||(marks[j] == ((3*p)-4))){
							if(s>0){
								s--;
								count++;
							}
						
						}
						}
					}
					System.out.println("Case #"+i+": "+count);
				}
			}
			
		}

	}


