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);
	}

}

package codejam;

import java.io.*;
import java.util.*;

public class DancingWithGooglers {
	
	public static void main(String[] args) throws IOException {
		BufferedReader inp = new BufferedReader(new InputStreamReader(System.in));
		int noOfTestCases = Integer.parseInt(inp.readLine());
		StringTokenizer str;
		int noOfGooglers;
		int noOfSurprises;
		int bandWidth;
		int currScore;
		ArrayList<Integer> results = new ArrayList<Integer>();
		
		for(int i=0;i<noOfTestCases;i++)
		{
			int num = 0;
			str = new StringTokenizer(inp.readLine());
			noOfGooglers = Integer.parseInt(str.nextToken());
			noOfSurprises = Integer.parseInt(str.nextToken());
			bandWidth = Integer.parseInt(str.nextToken());
			if(bandWidth == 0)
			{
				results.add(noOfGooglers);
				continue;
			}
			for(int j=0;j<noOfGooglers;j++)
			{
				 currScore = Integer.parseInt(str.nextToken());
				 if(currScore > (bandWidth - 1)*3)
				 {
					 num++;
					 continue;
				 }
				 if(bandWidth == 1)
					 continue;
				 if(noOfSurprises > 0 && currScore > ((bandWidth - 2)*3 + 1))
				 {
					 num++;
					 noOfSurprises--;
				 }
			}
			results.add(num);
		}
		
		ListIterator<Integer> itr = results.listIterator();
		int i=1;
		while(itr.hasNext())
		{
			System.out.println("Case #" + i + ": " + itr.next());
			i++;
		}
	}
}
