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.Scanner;
import java.io.*;
public class Dancing {

	public static void main(String [ ] args) throws Exception{
		Scanner in = new Scanner(new File(args[0]));
		PrintStream Output = new PrintStream(new FileOutputStream("soluzione.txt"));
		int n = in.nextInt();
		for(int i = 1; i <= n; i++){
			int tot, a, b, c;
			int contatore = 0;
			int partecipanti  = in.nextInt();
			int triplSorp = in.nextInt();
			int punteggio = in.nextInt();
			for(int j = 0; j < partecipanti; j++){
				tot = in.nextInt();
				a = tot/3;
				b = a;
				c = a;
				if (a > punteggio) contatore++;
				else{
					if (tot == (a + b + c)){ // solo in questo caso si puo avere un risultato sorpreendente
						if (a >= punteggio) contatore++;

						else if (triplSorp != 0 && a > 1){
							a++;
							if (a >= punteggio){
								contatore++;
								triplSorp--;
							}
						}
					}
					else {
						b++;
						if (tot == (a + b + c)){
							if (a >= punteggio) contatore++;
							else if (b >= punteggio) contatore++;
						}
						else{
							c++;
							if (tot == (a + b + c)){
								if (a >= punteggio) contatore++;
								else if (b >= punteggio) contatore++;
								else if(triplSorp != 0) {
									c--;
									b++;
									if (tot == (a + b + c)){							
										if (b >= punteggio) {
											triplSorp--;
											contatore++;
										}
									}

								}
							}
						}	
					}
				}
				
			}
			String x = "Case #" + i + ": "+ contatore;
			Output.println(x);
		}
	}
}
