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.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.util.ArrayList;


public class DWG {
	public static void main(String[] args) {
		Integer caseNum = 0;
		/*if(args.length == 0) {
			return;
		}
		caseNum = Integer.parseInt(args[0]);*/
		ArrayList<String> argList = new ArrayList<String>();
		
		String line=null;
		File inputFile = new File("DWGData.txt");
		BufferedReader reader;
		try {
			reader = new BufferedReader(new FileReader(inputFile));
			while ((line=reader.readLine()) != null) {
				argList.add(line);
			}
		} catch (Exception e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}
		
		caseNum = Integer.parseInt(argList.get(0));
		
		for(int caseIndex=0; caseIndex < caseNum.intValue(); caseIndex++) {
			String input = argList.get(caseIndex+1);
			System.out.println("Case #" + (caseIndex+1) + ": " + countGooglers(input));
		}
	}
	
	private static int countGooglers(String input) {
		int numOfWiners = 0;
		String[] inputData = input.split(" ");
		if(inputData.length >=4) {
			int numOfGooglers = Integer.parseInt(inputData[0]);
			int numOfSurprise = Integer.parseInt(inputData[1]);
			int score = Integer.parseInt(inputData[2]);
			
			int minWithSurprise = ((score > 2) ? (score-2) : 0)*2 + score;
			int minWithoutSurprise = ((score > 1) ? (score-1) : 0)*2 + score;
			
			if((inputData.length-3) == numOfGooglers) {
				int[] scoreOfGooglers = new int[numOfGooglers];
				for(int i=0; i < numOfGooglers; i++) {
					scoreOfGooglers[i] = Integer.parseInt(inputData[i+3]);
					if(scoreOfGooglers[i] >= minWithoutSurprise) {
						numOfWiners++;
					}else if(scoreOfGooglers[i] >= minWithSurprise) {
						if(numOfSurprise > 0) {
							numOfWiners++;
							numOfSurprise--;
						}
					}
				}
				
			}
		}
		
		return numOfWiners;
	}
}
