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.*;
public class Main {
	public static void main(String[] args) throws Exception{
		BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
		int cases=Integer.parseInt(in.readLine());
		for(int i=1;i<=cases;i++)
		{
			String line = in.readLine();
			String parts[] = line.split(" ");
			int out = 0;
			int n = Integer.parseInt(parts[0]);
			int s = Integer.parseInt(parts[1]);
			int p = Integer.parseInt(parts[2]);
			int count = 0;
			int marks[] = new int[n];
			for(int j=0;j<n; j++){
				marks[j] = Integer.parseInt(parts[3+j]);
			}
			if(p == 0){
				count = n;
				System.out.println("Case #"+i+": "+count);
				continue;
			}
			else{
				for(int j = 0 ; j < n ; j++){
					if(marks[j] != 0){
						if(marks[j] >= 3*p){
							count++;
							continue;
						}
						else if(marks[j] == ((3*p)-2)){
							count++;
							continue;
						}
						else if(marks[j] == ((3*p)-1)){
							count++;
							continue;
						}
						else if((marks[j] == ((3*p)-3) )||(marks[j] == ((3*p)-4))){
							if(s>0){
								s--;
								count++;
							}
						
						}
						}
					}
					System.out.println("Case #"+i+": "+count);
				}
			}
			
		}

	}


