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.IOException;
import java.io.PrintStream;
import java.util.Scanner;


public class Dancing {
	
	public static void main(String[] args) throws IOException {
		File file = new File("c:\\java\\DancingResults.txt");
		File inFile = new File("c:\\java\\B-large.in");
		file.createNewFile();
		PrintStream out = new PrintStream(file);
		Scanner scanIn = new Scanner(inFile);
		
		int T = 0;
		int n = 0;
		int p = 0;
		int score = 0;
		
		int s = 0;
		int total = 0;
		
		T = scanIn.nextInt();//number of cases
		
		for(int i = 0; i < T; i++, total = 0){
			n = scanIn.nextInt();//Number of dancers in case
			s = scanIn.nextInt();//number of surprising scores
			p = scanIn.nextInt();//score to be obtained
			for(int j = 0; j < n; j++){
				score = scanIn.nextInt();
				
				if(p == 0){
					total++;
					continue;
				}
				
				if(score >= minPossible1(p)){
					total++;
				}
				else if(score >= minPossible2(p) && s>0){
					total++;
					s--;
				}
				
			}//End of n loop
			
			out.println("Case #"+(i+1)+": "+total);
			
		}//End of Case-loop
	}
	
	public static int minPossible1(int pt){
		if((pt*3)-2 <= 0) return 1;
		
		return (pt*3)-2;
	}
	
	public static int minPossible2(int pt){
		if((pt*3)-4 <= 0) return 1;
		
		return (pt*3)-4;
	}

}
