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


class DancingWithGooglers {

    Scanner s = new Scanner(System.in);
	
    public static void main(String args[]) {
	    DancingWithGooglers p = new DancingWithGooglers();
	    p.run();
	}
	
	void run() {
	    prepare();
	    int nCases = s.nextInt();
		for (int i=0; i<nCases; i++) {
			System.out.println("Case #"+(i+1)+": "+runOneCase());
		}
	}
	
	int[][] mTable = new int[31][2];
	
	void prepare() {
	    for (int i=1; i<=28; i++) {
		    mTable[i][0] = (i+2) / 3;
			mTable[i][1] = (i+4) / 3;
		}
		
		mTable[29][0] = 10;
		mTable[29][1] = 10;
		mTable[30][0] = 10;
		mTable[30][1] = 10;
	}
	
	int runOneCase() {
	    int N = s.nextInt();
		int S = s.nextInt();
		int P = s.nextInt();
		
		int count = 0;
		for (int i=0; i<N; i++) {
		    int score = s.nextInt();
			if (mTable[score][0] >= P) {
			    count++;
		    } else if (S>0 && mTable[score][1]>=P) {
			    count++;
				S--;
			}
		}
	    return count;
	}

}