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.util.ArrayList;
import java.util.Arrays;


public class ProbB {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		ArrayList<String> in=Utils.readFile("B-large.in.in");
		ArrayList<String> out =new ArrayList<String>();
		for (int i = 1; i < in.size(); i++) {
			String[] str=in.get(i).split(" ");
			int n= Integer.parseInt(str[0]);
			int surprise=Integer.parseInt(str[1]);
			int p=Integer.parseInt(str[2]);
			int[] elem=new int[n];
			for (int j = 0; j < n; j++) {
				elem[j]=Integer.parseInt(str[j+3]);				
			}
			Arrays.sort(elem);
			int count=0;
			for (int j = elem.length-1; j >=0 ; j--) {
				if(elem[j]>=(3*p-2)){
					count++;
				}else if(elem[j]>=(3*p-4)){
					if(surprise==0||p==1){
						break;
					}else{
						count++;
						surprise--;
					}
				}else{
					break;
				}
			}
			out.add("Case #"+i+": "+count);
			Utils.writeFile(out, "B-large");
		}
		

	}

}
