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

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		Scanner in=new Scanner(System.in);
		int cases=in.nextInt();
		
		for (int x=1;x<=cases;x++){
			int c=0;
			int num=in.nextInt();
			int surp=in.nextInt();
			int best=in.nextInt();
		//	int[] dancer=new int[num];
			for (int y=0;y<num;y++){
				int dummy=in.nextInt();
				int point=dummy/3;
				int rest=dummy%3;
				if(point>=best)c++;
				else if (point+1>=best &&rest>=1)c++;
				else if (point+2>=best&&surp>0&&rest==2){
					c++;
					surp--;
				}
				else if (point+1>=best && surp>0 && point>0){
					c++;
					surp--;
				}
			}
			System.out.println("Case #"+x+": "+c);
		}

	}

}
