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 DancinWithGooglers {

    public static void main(String[] args) {
        try {
            Scanner input = new Scanner(new File("input.txt"));
            PrintStream output = new PrintStream(new FileOutputStream("output.txt"));
            solveTask(input, output);
        } catch (FileNotFoundException e) {
            System.out.println("input.txt not found");
        } catch (IOException e) {
            e.printStackTrace();
        }

    }

    private static void solveTask(Scanner input, PrintStream output) {

        int testsCount = input.nextInt();

        for (int test=1; test<=testsCount; test++) {

            int dancersCount = input.nextInt();
            int surprises = input.nextInt();
            int bestResult = input.nextInt();
            int scoreNeeded = bestResult*3-2;

            int gotResultAnywayCount = 0;
            int gotResultConditionallyCount = 0;

            for (int i=0; i<dancersCount; i++) {
                int score = input.nextInt();

                if (score >= scoreNeeded) {
                    gotResultAnywayCount++;
                } else if (score > 1 && score < 29 && score >= scoreNeeded-2) {
                    gotResultConditionallyCount++;
                }
            }

            int total = gotResultAnywayCount + Math.min(gotResultConditionallyCount, surprises);

            System.out.print("Case #"+test+": ");
            System.out.println(total);
            output.print("Case #"+test+": ");
            output.println(total);
        }
    }

}
