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.File;
import java.io.FileNotFoundException;
import java.util.Scanner;


public class Dance {
	public static void main(String[] args) throws FileNotFoundException {
		File file = new File("input.in");
		Scanner in = new Scanner(file);
		
		int cases = in.nextInt();
		
		for (int i = 0; i < cases; i++) {
			int N = in.nextInt(); //googlers
			int S = in.nextInt(); //surprising scores
			int p = in.nextInt();
			int [] scores = new int[N];
			for (int j = 0; j < scores.length; j++) {
				scores[j] = in.nextInt();
			}
			int max = 0;
			
			for (int j = 0; j < scores.length; j++) {
				if (scores[j] >= (3*p-2)) {
					max++;
				} else if (scores[j] >= (3*p-4) && S > 0 && !((3*p-4) <= 0) ) {
					max++;
					S--;
				}
			}
			System.out.println("Case #"+ (i+1) + ": " + max);	
		}
	}
}
