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

public class QualB12 {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int T = in.nextInt();

		for (int i = 1; i <= T; i++) {
			int N = in.nextInt();
			int S = in.nextInt();
			int p = in.nextInt();
			int g = 0;

			for (int j = 1; j <= N; j++) {
				int a = in.nextInt();
				if (a/3 >= p) ++g;
				else if (a/3 >= p-2) {
					if (a/3 == p-1) {
						if (a%3 == 2) {
							++g;
						} 
						else if (a%3 == 1) {
							++g;
						}
						else if (a%3 == 0) {
							if (S > 0 && a/3 > 0) {
								++g;
								--S;
							}
						}
					}
					else if (a/3 == p-2) {
						if (a%3 == 2) {
							if (S > 0){
								++g;
								--S;
							}
						} 
					}
					else {
						System.out.println("a is " + a + " and p is " + p);
						assert false;
					}
				}
			}
			System.out.println("Case #" + i + ": " + g);

		}
	}

	/* Self-Made Test Cases

	  4
	  3 0 5 0 0 0
	  3 1 6 14 13 12
	  2 0 10 30 30
	  4 1 5 13 12 11 11

		Case #1: 0
		Case #2: 1
		Case #3: 2
		Case #4: 2

	 */
}

