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

public class PB {

    public static void main(String[] args) throws FileNotFoundException {
        if (args.length != 1) {
            System.exit(1);
        }
        File inFile = new File(args[0]);
        Scanner sc = new Scanner(inFile);
        int T = sc.nextInt();
        try (PrintWriter out = new PrintWriter("out.txt")) {
            for (int i = 0; i < T; i++) {
                int N = sc.nextInt();
                int S = sc.nextInt();
                int p = sc.nextInt();
                int[] t = new int[N];
                for (int j = 0; j < N; j++) {
                    t[j] = sc.nextInt();
                }
                int[][] scores = new int[N][3];
                for (int j = 0; j < N; j++) {
                    scores[j][0] = t[j] / 3;
                    scores[j][1] = (t[j] - scores[j][0]) / 2;
                    scores[j][2] = t[j] - scores[j][0] - scores[j][1];
                }
                int count = 0;
                for (int j = 0; j < N; j++) {
                    boolean isSurprise = false;
                    if (scores[j][2] - scores[j][0] == 2) {
                        S--;
                        isSurprise = true;
                    }
                    if (scores[j][2] >= p) {
                        count++;
                    } else {
                        if (S > 0 && !isSurprise && (p - scores[j][2]) == 1 && scores[j][1] > 0) {
                            S--;
                            scores[j][1]--;
                            scores[j][2]++;
                            count++;
                        }
                    }
                }
                out.println("Case #" + (i + 1) + ": " + count);
            }
        }
        System.out.println("Completed");
    }
}
