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.*;
import java.util.*;
public class q2Alt{
public static void main (String[] args) throws IOException 
    {
	BufferedReader input = new BufferedReader (new FileReader ("B-large.txt"));
	PrintWriter output = new PrintWriter (new FileWriter("test2DoneAlt.out"));
	StringTokenizer st;
	
	int numOfLine = Integer.parseInt(input.readLine());
	for(int i = 0; i < numOfLine; i++){
	    st = new StringTokenizer(input.readLine());
	    int N = Integer.parseInt(st.nextToken());
	    int S = Integer.parseInt(st.nextToken());
	    int P = Integer.parseInt(st.nextToken());
	    int better = 0;
	    int[] scores = new int [N];
	    
	    for(int j = 0; j < N; j++){
		scores[j] = Integer.parseInt(st.nextToken());
	    }
	    
	    for(int j = 0; j < N; j++){
		int reduction = scores[j] - P;
		if(reduction < 0){}
		else if(reduction >= 2*(P - 1)){
		    better ++;
		}
		else if(reduction >= 2*(P-2) && S > 0){
		    better ++;
		    S --;
		}
	    }
	    
	    output.println("Case #" + (i+1) + ": " + better);
	}
	output.close();
    }
}          
