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.PrintWriter;
import java.util.Scanner;

/**
 *
 * @author pulasthi
 */
public class QB12 {

    public static void main(String[] args) throws Exception {
        Scanner sc = new Scanner(System.in);
        PrintWriter out = new PrintWriter("b.txt");
        int T = sc.nextInt();
        for (int i = 0; i < T; i++) {
            int result = 0;
            int N = sc.nextInt(); //no of googlers
            int S = sc.nextInt();   //surprising
            int p = sc.nextInt();   //max score
            int noSCutoff = p * 3 - 2;
            int sCutoff = p * 3 - 4;
            noSCutoff = Math.max(p, noSCutoff);
            sCutoff = Math.max(p, sCutoff);
            for (int j = 0; j < N; j++) {
                int number = sc.nextInt();
                if (number >= noSCutoff) {
                    result++;
                } else if (S > 0 && number >= sCutoff) {
                    S--;
                    result++;
                }
            }
            out.print("Case #" + (i + 1) + ": ");
            out.println(result);
        }
        out.flush();
        out.close();
    }
}
