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.File;
import java.io.PrintWriter;
import java.util.Scanner;


public class DancingWiththeGooglers {

	/**
	 * @param args
	 * @throws Exception 
	 */
	public static void main(String[] args) throws Exception {
		Scanner sc = new Scanner(new File("B-large.in"));
		PrintWriter pw = new PrintWriter("B-large.out");
		
		int tc = sc.nextInt();
		for(int i=1; i<=tc; i++){
			int N = sc.nextInt();
			int S = sc.nextInt();
			int P = sc.nextInt();
			int sum=0;
			for(int j=0; j<N; j++){
				int tot = sc.nextInt();
				int maxScore = (tot+2)/3;
				if(maxScore >= P){
					sum++;
				}else if(maxScore == P-1 && maxScore >0 && (tot%3)!=1){
					if(S>0){
						sum++;
						S--;
					}
				}
			}
			pw.println("Case #" + i + ": " + sum);
		}
		
		pw.close();
		sc.close();
	}

}
