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

class CodejamB {
    public static char[] map;
    public static void main (String [] args) throws IOException {
        BufferedReader in = new BufferedReader(new FileReader("E:/B-large.in"));
        PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter("E:/outB.txt")));
        int nTest = Integer.parseInt(in.readLine());
        for (int testIndex = 0; testIndex < nTest; testIndex++) {
            out.print("Case #" + (testIndex + 1) + ": ");
            /***** start **********/
            StringTokenizer st = new StringTokenizer(in.readLine());
            int n = Integer.parseInt(st.nextToken());
            int s = Integer.parseInt(st.nextToken());
            int p = Integer.parseInt(st.nextToken());
            int[] data = new int[n];
            int remainingS = s;
            int result = 0;
            for (int i = 0; i < n; i++) {
                data[i] = Integer.parseInt(st.nextToken());
                if (data[i] >= p + 2 * Math.max(0, p - 1)) {
                    result++;
                } else if (data[i] >= p + 2 * Math.max(0, p - 2) && remainingS > 0) {
                    remainingS--;
                    result++;
                }
            }
            out.print(result);
            /***** end   **********/
            out.println();
        }
        out.close();
    }
}