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 B_2012 {

	public static void main(String[] args) throws IOException {
		

		Scanner in = new Scanner(System.in);
		PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter("test3.out")));
		
		int NS[] = {0,1,1,1,2,2,2,3,3,3,4,4,4,5,5,5,6,6,6,7,7,7,8,8,8,9,9,9,10,10,10};
		int S[] = {-1,-1,2,2,2,3,3,3,4,4,4,5,5,5,6,6,6,7,7,7,8,8,8,9,9,9,10,10,10,-1,-1};
		
		int cases= in.nextInt();
		
		for(int c=0;c<cases;c++){
			int n = in.nextInt();
			int s = in.nextInt();
			int b = in.nextInt();	
			int C=0;
			ArrayList<Integer>  G = new ArrayList<Integer>();
					
			for(int i=0;i<n;i++) G.add(in.nextInt());
			Collections.sort(G);
			for(int i=0;i<G.size();i++){
				if(s>0 && S[G.get(i)]>=b) {
					s--;
					G.remove(i);
					C++;
					i--;
				}
			}
			for(int i=0;i<G.size();i++){
				if(s>0 && NS[G.get(i)]<b && S[G.get(i)]<b ) {
					s--;
					G.remove(i);
					i--;
				}
			}
			for(int i=0;i<G.size();i++)
				if(NS[G.get(i)]>=b ) C++;
			
			out.println("Case #"+(c+1)+": "+C);
			
		}
		out.close();
		System.exit(0);
	}
}
