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


public class Test {
	public static void main (String args[]) throws FileNotFoundException {
		Scanner in = new Scanner(new File ("src//qualitfy/input.in"));
		int T = in.nextInt();
		for (int i = 0; i < T; i++) {
			int N  = in.nextInt();
			int S = in.nextInt();
			int p = in.nextInt();
			int count = 0;
			int n1=0,n2=0,n3=0;
			for (int j = 0; j < N; j++) {
				int no = in.nextInt();
				int div = no % 3;
				n1 = n2 = n3 = no/3;
				if (div==1)
					n3 = n3 + 1;
				if (div == 2)
					n2 = n3 = n3 + 1;
				
				if (n3 >= p)
					count++;
				else if (S != 0 && no >= 2) {
					if(n2 == n3) {
						n3 = n3 + 1;
						n2 = n2 - 1;
						if (n3 >= p) {
							count++;
							S--;
						}
					}						
				}
			}

			System.out.println("Case #" + (i + 1) + ": " + count);
		}
	}

}