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

public class codejam3 {

    public static void main(String[] args) throws FileNotFoundException, IOException {
        File file = new File("B-small-attempt0.in");
        FileReader fr = new FileReader(file);
        Scanner ob = new Scanner(fr);
        File outFile = new File("outFile3.txt");
        FileWriter outFilew = new FileWriter(outFile);
        int t, r = 1;
        t = ob.nextInt();
        while (t != 0) {
            int n, s, p, count = 0;
            n = ob.nextInt();
            s = ob.nextInt();
            p = ob.nextInt();
            int a[] = new int[n];
            for (int i = 0; i < n; i++) {
                a[i] = ob.nextInt();
                if (a[i] >= p) {
                    if (a[i] >= 3 * p - 2) {
                        count++;
                    } else if ((a[i] == 3 * p - 4 || a[i] == 3 * p - 3) && s != 0) {
                        s--;
                        count++;
                    }
                }
            }
            System.out.println(count);
            outFilew.append("Case #"+r+": "+count+"\n");
            t--;
            r++;
        }
        outFilew.close();
    }
}
