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 Surp {

	/**
	 * @param args
	 */
	public static void main(String[] args) { 
		int T,S,p,N=0;
		String L="";
		Scanner b = new Scanner(System.in);
		T=b.nextInt();
		L=b.nextLine();
		for(int i=0;i<T;i++){
			L=b.nextLine();
			String F[]=L.split(" ");
			N=0;
			S=Integer.parseInt(F[1]);
			p=Integer.parseInt(F[2]);
			int min=p+2*(p-2);
			if(min<=1){
				min=p;
			}
			for(int j=3;j<F.length;j++){
					int val=Integer.parseInt(F[j]);
					if(min<=val){
						if(min+1<val||min==0)
							N++;
						else
							if(S>0){
								S--;
								N++;
							}
						}
				}
			System.out.println("Case #"+(i+1)+": "+N);
			}
		}
	

}
