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.util.Scanner;

public class B {

	public static void main(String[] args) {
		try {
			Scanner scanner = new Scanner(System.in);
			int lp = scanner.nextInt();
			int c = 0;
			for (int loop = 0; loop < lp; loop++) {
				int N = scanner.nextInt();
				int S = scanner.nextInt();
				int p = scanner.nextInt();
				int ans = 0;
				for (int j = 0; j < N; j++) {
					int t = scanner.nextInt();
					if (t < 2) {
						if (p <= t) {
							ans++;
						}
					}
					if (t == 2) {
						if (p < t) {
							ans++;
						}
						if (p == t && S > 0) {
							ans++;
							S--;
						}
					}
					if (t > 2) {
						if (t / 3 >= p) {
							ans++;
						} else {
							switch (t % 3) {
							case 0:
								if (t / 3 + 1 == p && S > 0) {
									S--;
									ans++;
								}
								break;
							case 1:
								if (t / 3 + 1 == p) {
									ans++;
								}
								break;
							case 2:
								if (t / 3 + 1 == p) {
									ans++;
								} else if (t / 3 + 2 == p && S > 0) {
									ans++;
									S--;
								}
								break;
							}
						}
					}
				}
				c++;
				System.out.println("Case #" + c + ": " + ans);
			}
		} catch (Exception e) {
			e.printStackTrace();
		}
	}

}
