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.*;
public class googleJam2 {

	/**
	 * @param args
	 */
	public static void main(String[] args) throws Exception {
		// TODO Auto-generated method stub
		BufferedReader reader = null;
		PrintWriter writer = null;
		try{
			reader = new BufferedReader(new FileReader("B-large.in"));
			int numInputs = Integer.parseInt(reader.readLine());
			writer = new PrintWriter(new BufferedWriter(new FileWriter("B-large.out")));
			for(int i = 0; i < numInputs; i++)
			{
				System.out.println(i);
				String temp = reader.readLine();
				System.out.println(temp);
				int index = temp.indexOf(" ");
				int numGooglers = Integer.parseInt(temp.substring(0, index));
				temp = temp.substring(index+1);
				index = temp.indexOf(" ");
				System.out.println(temp);
				int numSurprising = Integer.parseInt(temp.substring(0,index));
				temp = temp.substring(index+1);
				index = temp.indexOf(" ");
				int p = Integer.parseInt(temp.substring(0,index));
				temp = temp.substring(index+1);
				int withoutSurprise = 0;
				int withSurprise = 0;
				for(int k = 0; k < numGooglers-1; k++)
				{
					index = temp.indexOf(" ");
					int totalScore = Integer.parseInt(temp.substring(0, index));
					temp = temp.substring(index+1);
					if(totalScore >= 3*p -2)
						withoutSurprise++;
					else if(totalScore >= 3*p-4 && totalScore >= p)
						withSurprise++;
				}
				int totalScore = Integer.parseInt(temp);
				if(totalScore >= 3*p -2)
					withoutSurprise++;
				else if(totalScore >= 3*p-4 &&totalScore >= p)
					withSurprise++;
				int numWinners;
				if(withSurprise >= numSurprising)
					numWinners = numSurprising + withoutSurprise;
				else
					numWinners = withSurprise + withoutSurprise;
				writer.print("Case #" + (i+1) + ": " + numWinners + "\n");
				
				
			}
			writer.close();
		}
		catch(Exception e)
		{
			throw(e);
		}
	}

}
