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

}
/*
Sam1rm
Google Code Jam
*/
import java.io.*;
import java.util.*;

class ProblemB
{
    public static void main (String [] args) throws IOException 
    {
	String filename = args[0];  
	BufferedReader f = new BufferedReader(new FileReader(filename + ".in"));
	PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter(filename + ".out")));
	int numberOfTests = Integer.parseInt(f.readLine());
	for(int n = 1; n <= numberOfTests; n++)
	    {
		int solution = 0;
		String input = f.readLine();
		solution = parseString(input);
		out.println("Case #" + n + ": " + solution);
	    }
	out.close();
	System.exit(0);
    }
    
    public static int parseString(String input1) {
	int solution = 0;
	String[] input = input1.split(" ");
	int N = Integer.parseInt(input[0]);
	int S = Integer.parseInt(input[1]);
	int P = Integer.parseInt(input[2]);
	for (int i = 0; i < input.length - 3; i++) {
	    int current = Integer.parseInt(input[i + 3]);
	    if (current >= (P * 3 - 2)) {
		solution++;
	    } else {
		if ((S > 0) && current >= (P * 3 - 4) && (P * 3 - 4 > 0)) {
		    S--;
		    solution++;
		}
	    }
	}
	return solution;
    }
}


