package codejam;

import fixjava.Pair;

public class Utils {

	public static long minLong(long firstVal, long... otherVals) {
		long minVal = firstVal;
		for (int i = 0; i < otherVals.length; i++)
			minVal = Math.min(firstVal, otherVals[i]);
		return minVal;
	}

	public static int minInt(int firstVal, int... otherVals) {
		int minVal = firstVal;
		for (int i = 0; i < otherVals.length; i++)
			minVal = Math.min(firstVal, otherVals[i]);
		return minVal;
	}

	public static float minFloat(float firstVal, float... otherVals) {
		float minVal = firstVal;
		for (int i = 0; i < otherVals.length; i++)
			minVal = Math.min(firstVal, otherVals[i]);
		return minVal;
	}

	/**
	 * ArgMin returned as a Pair<Integer, Integer>(index, value). Array must
	 * have at least one value.
	 */
	public static Pair<Integer, Integer> argMin(int[] arr) {
		int min = arr[0];
		int argMin = 0;
		for (int i = 1; i < arr.length; i++) {
			if (arr[i] < min) {
				min = arr[i];
				argMin = i;
			}
		}
		return new Pair<Integer, Integer>(argMin, min);
	}

	/**
	 * ArgMax returned as a Pair<Integer, Integer>(index, value). Array must
	 * have at least one value.
	 */
	public static Pair<Integer, Integer> argMax(int[] arr) {
		int max = arr[0];
		int argMax = 0;
		for (int i = 1; i < arr.length; i++) {
			if (arr[i] > max) {
				max = arr[i];
				argMax = i;
			}
		}
		return new Pair<Integer, Integer>(argMax, max);
	}

}

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-large.in",
		"C:\\skill\\workspace\\cj2012\\src\\B-large.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);
		}
		

	}

}
