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.*;
import java.util.*;


public class DancingWithTheGooglers {

	public static void main (String[] args) throws IOException {
		Scanner in = new Scanner(new File("B-small.txt"));
		
		int cases;
		cases = in.nextInt();
		
		int google, s, p;
		int count;
		
		int temp;
		
		for (int n = 0; n < cases; n++) {
			google = in.nextInt();
			s = in.nextInt();
			p = in.nextInt();
			count = 0;
			
			for (int i = 0; i < google; i++) {
				temp = in.nextInt();
				
				if (p == 0) {
					count ++;
				} else if (p == 1 && temp == 0) {
					continue;
				} else if (temp/3 >= p) {
					count ++;
				} else if (temp/3 == p - 1 && temp%3 >= 1) {
					count ++;
				} else if (temp/3 == p - 1 && temp%3 == 0){
					if (s != 0) {
						count ++;
						s--;
					}
				} else if (temp/3 == p - 2 && temp%3 == 2) {
					if (s != 0) {
						count ++;
						s--;
					}
				}
			}			
			
			System.out.println("Case #" + (n+1) + ": " + count);
		}

	}
}