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


public class B {

	public int solve(String input){
		int result=0;
		StringTokenizer st=new StringTokenizer(input, " \n");
		int n=Integer.parseInt(st.nextToken());
		int s=Integer.parseInt(st.nextToken());
		int p=Integer.parseInt(st.nextToken());
		int maxThres=0;
		int minThres=0;
		if(p>1){		
		 maxThres=(p-1)*3+1;
		 minThres=(p-2)*3+2;
		}else{
			maxThres=p;
			minThres=p;
		}
		while(st.hasMoreTokens()){
			int num=Integer.parseInt(st.nextToken());
			if(num>=maxThres){
				result++;
				continue;
			}
			if(num>=minThres && num<maxThres && s>0){
				result++;
				s--;
			}
		}
		
		return result;
	}
	public static void main(String[] args) {
		IOHelper io=new IOHelper("C:\\skill\\workspace\\cj2012\\src\\B-small-attempt1.in",
		"C:\\skill\\workspace\\cj2012\\src\\B-small-attempt1.out");
		int countOfTest=Integer.parseInt(io.readLine());
		B b=new B();
		for(int i=0;i<countOfTest;i++){
			String s=io.readLine();
			int solution= b.solve(s);
			String output="Case #"+(i+1)+": "+solution;
			io.writeLine(output);
		}
		

	}

}
