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.*;
import java.lang.Math.*;

public class DancingWithTheGooglers {

	public static void main(String[] args) throws IOException{
		Scanner in = new Scanner(new File("DancingWithTheGooglers.in"));
	    PrintWriter p = new PrintWriter("DancingWithTheGooglers.out");
	    int t = Integer.parseInt(in.nextLine());
	    int n;
	    int s;
	    int h;
	    int q;
	    int [] d = new int[100]; 
	    for(int c = 1; c < t+1; c++){
	    	q = 0;
	    	n = Integer.parseInt(in.next());
	    	s = Integer.parseInt(in.next());
	    	h = Integer.parseInt(in.next())-1;
	    	for (int i = 0; i < n; i++){
	    		d[i] = Integer.parseInt(in.next());
	    		if(d[i] > 3*h){
	    			q++;
	    		}else if((d[i]==3*h||d[i]==3*h-1)&&s > 0&& h!= 0){
	    			q++;
	    			s--;
	    		}
	    	}
	    	p.println("Case #"+c+": "+q);
	    	if(c!=t)in.nextLine();
	    }
	    in.close();
	    p.close();
	}

}