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.io.IOException;
import java.util.StringTokenizer;

public class Judging {
	private int cases;

	public Judging() throws IOException {
		cases = Integer.valueOf(getLine());

		run();
	}

	public String getLine() throws IOException {
		String s = "";
		char c;
		while ((c = (char) System.in.read()) != '\n') {
			s += c;
		}
		return s;
	}

	public void run() throws IOException {
		Case curr;
		for (int i = 0; i < cases; i++) {
			curr = new Case(getLine());
			System.out.println("Case #" + (i+1) + ": " + curr.calculateNumBestResult());
		}
	}
	/**
	 * @param args
	 */
	public static void main(String[] args) {
		try {
			new Judging();
		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}
	}

}

class Case {
	private int numberOfGooglers;
	private int numberOfSuprisingScores;
	private int bestResult;
	private int[] scores;

	public Case(String line) {
		StringTokenizer tokens = new StringTokenizer(line);

		numberOfGooglers = Integer.valueOf(tokens.nextToken());
		numberOfSuprisingScores = Integer.valueOf(tokens.nextToken());
		bestResult = Integer.valueOf(tokens.nextToken());
		scores = new int[numberOfGooglers];

		for (int i = 0; i < numberOfGooglers; i++) {
			scores[i] = Integer.valueOf(tokens.nextToken());
		}
	}

	public int calculateNumBestResult() {
		int counter = 0;
		if (bestResult >= 2) {
			for (int i = 0; i < scores.length; i++) {
				if (scores[i] - (3*bestResult) >= -2)
					counter++;
				else if (scores[i] - (3*bestResult) >= -4) {
					if (numberOfSuprisingScores > 0) {
						counter++;
						numberOfSuprisingScores--;
					}
				}
			}
		} else if (bestResult == 1) {
			for (int i = 0; i < scores.length; i++) {
				if (scores[i] > 0)
					counter++;
			}
		} else if (bestResult == 0) {
			counter = scores.length;
		} else {
			System.err.println("Error!");
		}
		return counter;
	}

}