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.File;
import java.io.PrintWriter;
import java.util.Scanner;


public class DancingWiththeGooglers {

	/**
	 * @param args
	 * @throws Exception 
	 */
	public static void main(String[] args) throws Exception {
		Scanner sc = new Scanner(new File("B-small-attempt1.in"));
		PrintWriter pw = new PrintWriter("B-small.out");
		
		int tc = sc.nextInt();
		for(int i=1; i<=tc; i++){
			int N = sc.nextInt();
			int S = sc.nextInt();
			int P = sc.nextInt();
			int sum=0;
			for(int j=0; j<N; j++){
				int tot = sc.nextInt();
				int maxScore = (tot+2)/3;
				if(maxScore >= P){
					sum++;
				}else if(maxScore == P-1 && maxScore >0 && (tot%3)!=1){
					if(S>0){
						sum++;
						S--;
					}
				}
			}
			pw.println("Case #" + i + ": " + sum);
		}
		
		pw.close();
		sc.close();
	}

}
