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 code_jam_quali;

import java.util.Scanner;

/**
 *
 * @author sansarun
 */
public class Dancing {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int caseNum = sc.nextInt();

        for (int currentCase = 1; currentCase <= caseNum; currentCase++) {
            int googlers = sc.nextInt();
            int surprise = sc.nextInt();
            int p = sc.nextInt();

            int alreadyPass = 0;
            int canHelp = 0;

            for (int i = 0; i < googlers; i++) {
                int totalScore = sc.nextInt();
                int maxCompound = findMaxCompound(totalScore);
                int fragment = totalScore % 3;

                if (totalScore < 3) {
                    if(findMaxCompound(totalScore) >= p) {
                        alreadyPass++;
                    }
                } else {
                    switch (fragment) {
                        case 1:
                            if (maxCompound >= p) {
                                alreadyPass++;
                            }
                            break;
                        case 0:
                        case 2:
                            if (maxCompound >= p) {
                                alreadyPass++;
                            } else if (maxCompound + 1 >= p) {
                                canHelp++;
                            }
                            break;
                    }
                }
            }
            int totalPass = alreadyPass + (canHelp > surprise ? surprise : canHelp);
            System.out.println(String.format("Case #%d: %d", currentCase, totalPass));
        }
    }

    private static int findMaxCompound(int n) {
        return (int) Math.round(Math.ceil(n / 3.0));
    }
}
