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 ProjB {
	static Scanner scan = new Scanner (System.in);
	
	static void test (int k ) {
		System.out.print ("Case #" + k + ": ");
		int N = scan.nextInt();
		int S = scan.nextInt();
		int p = scan.nextInt();
		int[] input = new int[N];
		for (int i = 0; i < N; ++i)
			input[i] = scan.nextInt();
		Arrays.sort(input);
		
		int min1 = (p >= 1)? 3*p-2:0;
		int min2 = -1;
		if (p >= 2)
			min2 = 3 * p - 4;
		else if (p == 1)
			min2 = 1;
		else
			min2 = 0;
		int k1 = N - 1;
		while (k1 >= 0 && input[k1] >= min1)
			--k1;
		int ans = N - 1 - k1;
		int k2 = k1;
		while (k2 >=0 && (k1 + 1 - k2) <= S && input[k2] >= min2)
			--k2;
		ans += k1 - k2;
		System.out.println (ans);
		
	}
	
	public static void main (String[] args) {
		int T = scan.nextInt();
		for (int i = 1; i <= T; ++i)
			test (i);
		
	}
}
