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

import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.Scanner;

public class Problem_B {

	/**
	 * @param args
	 * @throws FileNotFoundException
	 */
	public static void main(String[] args) throws FileNotFoundException {
		String filename = "B-small-attempt0 (1).in";
		Scanner s = new Scanner(new FileReader(filename));
		PrintWriter out = new PrintWriter("out.txt");
		int num = s.nextInt();
		for (int CASE = 1; CASE <= num; CASE++) {
			int n = s.nextInt();
			int sr = s.nextInt();
			int p = s.nextInt();
			int[] compet = new int[n];
			for (int i = 0; i < n; i++) {
				compet[i] = s.nextInt();
			}
			int count = 0;
			for (int i = 0; i < compet.length; i++) {
				int divide = compet[i] / 3;
				int rem = compet[i] % 3;
				if (divide >= p)
					count++;
				else {
					if (rem == 0 && sr > 0 && divide > 0 && divide + 1 >= p) {
						count++;
						sr--;
					} else if (rem == 1 && divide + 1 >= p) {
						count++;
					} else if (rem == 2) {
						if (divide + 1 >= p)
							count++;
						else if (sr > 0 && divide + 2 >= p) {
							count++;
							sr--;
						}
					}
				}
			}
			out.println("Case #" + CASE + ": " + count);
		}
		out.close();
	}
}
