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);
	}

}

package dancingWithTheGooglers;

import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileWriter;
import java.io.IOException;
import java.io.StringReader;
import java.io.Writer;
import java.util.Arrays;
import java.util.Scanner;

public class DancingWithTheGooglers {

	public static String processaCaso(String linha, int i) {
		Scanner scan = new Scanner(new StringReader(linha));
		int numGooglers = scan.nextInt();
		int numSurprising = scan.nextInt();
		int p = scan.nextInt();
		int [] scores = new int[numGooglers];
		for (numGooglers--; numGooglers >= 0; numGooglers--) {
			scores[numGooglers] = scan.nextInt();
		}
		Arrays.sort(scores);
		int maxBestResult = 0;
		int idxMaiorQP = scores.length -1;
		for (; idxMaiorQP >= 0; idxMaiorQP--) {
			int resto = scores[idxMaiorQP]%3;
			int bestResult = scores[idxMaiorQP]/3;
			if (resto > 0) bestResult += 1;
			if (bestResult < p) break;
			maxBestResult++;
		}
		while (numSurprising > 0 && idxMaiorQP >= 0) {
			int resto = scores[idxMaiorQP]%3;
			int bestResult = scores[idxMaiorQP]/3;
			if (bestResult > 0 && resto == 0) bestResult += 1;
			else bestResult += resto;
			if (bestResult < p) break;
			maxBestResult++;
			numSurprising--;
			idxMaiorQP--;
		}
		return String.format("Case #%d: %d", i, maxBestResult);
	}
	
	/**
	 * @param args
	 * @throws IOException 
	 */
	public static void main(String[] args) throws IOException {
        Scanner scan = new Scanner(new File(args[0]));
        int numTestCases = scan.nextInt();
        scan.nextLine();
        Writer saida = new FileWriter(args[0]+".out");
		for (int i = 1 ; i <= numTestCases; i++) {
			saida.write(processaCaso(scan.nextLine(),i)+"\n");
		}
		saida.close();
	}

}
