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

public class Dancers {

    public static void main(String[] args) throws FileNotFoundException, IOException {
        Scanner sc = new Scanner(new File("D:/testing/B-large.in"));
        BufferedWriter bf = new BufferedWriter(new FileWriter("D:/testing/b.txt", false));

        int T = sc.nextInt();
        for (int i = 1; i <= T; i++) {
            int N, S, p;
            int hscr = 0, mscr = 0;
            N = sc.nextInt();
            S = sc.nextInt();
            p = sc.nextInt();

            for (int j = 0; j < N; j++) {
                int scr = sc.nextInt();
                if (scr > 3 * (p - 1)) {
                    hscr++;
                } else if (p>1 &&  scr > 3 * (p - 2) + 1) {
                    mscr++;
                }
            }
            int max=hscr+ Math.min(S, mscr);
             System.out.println("Case #" + i+": "+max);
             bf.write("Case #" + i+": "+max+ "\n");
        }
        bf.close();
    }
}
