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;
	}

}
package Qualification;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class DancingWithGooglers {
	public static void main(String[] args) throws NumberFormatException,
			IOException {
		BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
		int t = Integer.parseInt(in.readLine());
		for (int m = 1; m <= t; m++) {
			String[] S = in.readLine().split(" ");
			int n = Integer.parseInt(S[0]);
			int sur = Integer.parseInt(S[1]);
			int p = Integer.parseInt(S[2]);
			int[] A = new int[n];
			for (int i = 0; i < n; i++)
				A[i] = Integer.parseInt(S[i + 3]);
			int cnt = 0;
			for (int i = 0; i < n; i++)
				if (Math.ceil(A[i] / 3.0) >= p)
					cnt++;
				else if (A[i] >= p && p - (A[i] - p) / 2 == 2 && sur > 0) {
					sur--;
					cnt++;
				}
			System.out.println("Case #" + m + ": " + cnt);
		}
	}
}
