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.util.*;
import java.io.*;

public class B{
	
	public static void main(String[] args) throws IOException{
		Scanner inp = new Scanner(new File("B-large.in"));
		PrintWriter pw = new PrintWriter(new FileWriter("b-large.out"));
		
		int numCases = inp.nextInt();
		
		for (int cas = 0; cas < numCases; cas++){
			pw.print("Case #" + (cas+1) + ": ");
			
			/* case input */
			int N = inp.nextInt();
			int S = inp.nextInt();
			int p = inp.nextInt();
			int[] t = new int[N];
			for (int i = 0; i < N; i++){
				t[i] = inp.nextInt();
			}
			/* end case input */
			
			/* main logic */
			int ans = 0;
			
			int bNoS = 3*p - 2;
			if (bNoS < 0){
				bNoS = 0;
			}
			
			int bS = 3*p - 4;
			if (bS < 2){
				bS = 2;
			}
			
			for (int i = 0; i < N; i++){
				int ti = t[i];
				if (ti >= bNoS){
					ans++;
					continue;
				}
				else if (ti >= bS){
					if (S > 0){
						S--;
						ans++;
						continue;
					}
					else{
						continue;
					}
				}
				else{
					continue;
				}
			}
			
			pw.println(ans);
		}
		pw.close();
	}
}
