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.BufferedReader;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;


public class problemC {
	public static void main (String[] argv) throws Exception{
		BufferedReader in = new BufferedReader(new InputStreamReader(
				new FileInputStream("test.in")));
		PrintWriter pw = new PrintWriter(new FileOutputStream("result.txt"));
		int number = Integer.parseInt(in.readLine());
		String line = "";
		int cases;
		int base;
		int score;
		int l=1;
		for (int k=0;k<number;k++){
		line=(in.readLine());
		cases=0;
		String[] test=line.split(" ");
		int nbpeople=Integer.parseInt(test[0]);
		int surprise=Integer.parseInt(test[1]);
		int min=Integer.parseInt(test[2]);
		for (int i=3;i<test.length;i++){
			score=Integer.parseInt(test[i]);
			base=score/3;
			switch (score % 3){
			case 0:
				if (base>=min){
					cases++;
				}else{
					if ((surprise > 0)&&(base>0)&& ((base+1)>=min)){
						cases++;
						surprise--;
					}
				}
				break;
			case 1:
				if ((base >= min) || ((base+1) >=min)) {
					cases++;
				}else{
					if ((surprise >0)&&((base+1)>=min)){
						cases++;
						surprise--;
					}
				}
				break;
			case 2:
				if (((base+1)>min)|| (base >=min)){
					cases++;
				}else{
					if ((surprise >0)&& ((base+2)>= min)){
						cases++;
						surprise--;
					}
				}
				break;
			}
		}
		
		pw.append("Case #" + l + ": " + cases+ "\n");
		l++;
		//System.out.println (cases);
		
		}
		pw.flush();
	}
}