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

public class codejam3 {

    public static void main(String[] args) throws FileNotFoundException, IOException {
        File file = new File("B-large.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();
    }
}
