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.BufferedReader;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.util.HashMap;
import java.util.Map;
import java.util.StringTokenizer;

public class B {
	Map<String, String> mapLenguaje;

	public static void main(String arg[]) {
		try {
			StringBuffer line;
			
			File file = new File("C:/Documents and Settings/jjmamby/Mis documentos/Descargas/B-large.in");
			int T = 0, N = 0, S = 0, maxP, t, bestResult, p;
			StringBuilder output = new StringBuilder();
			if (file.exists()) {
				BufferedReader input = new BufferedReader(new FileReader(file));
				
				T = Integer.valueOf((input.readLine()));
				for (int i = 0; i < T; i++) {
					line = new StringBuffer(input.readLine());
					StringTokenizer st = new StringTokenizer(line.toString(), " ");
					N = Integer.valueOf(st.nextToken());
					S = Integer.valueOf(st.nextToken());
					maxP = Integer.valueOf(st.nextToken());
					p = 0;
					for(int j = 0; j < N; j++){
						t = Integer.valueOf(st.nextToken());
						int aux1 = t / 3 ;
						bestResult = aux1;
						int aux2 = (t - aux1) / 2 ;
						
						if(aux2>bestResult){
							bestResult = aux2;
						}
						int aux3 = (t - aux1 - aux2) ;
						if(aux3>bestResult){
							bestResult = aux3;
						}
												
						if(maxP<=aux3){
							p++;
						}else if (t > 2 && t < 28){
							aux2--;
							aux3++;
							if(maxP<=aux3&& S>0 ){
								S--;
								p++;
							}
						}
					}
					output.append("Case #");
			    	output.append((i+1));
			    	output.append(": ");
			    	output.append(p);
			    	output.append("\n");
				}
				System.out.println(output.toString());
			}else{
				output.append("No hay Archivo");
			}
				
		} catch (Exception e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}
	}
}
