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


public class Test {
	public static void main (String args[]) throws FileNotFoundException {
		Scanner in = new Scanner(new File ("src//qualitfy/input.in"));
		int T = in.nextInt();
		for (int i = 0; i < T; i++) {
			int N  = in.nextInt();
			int S = in.nextInt();
			int p = in.nextInt();
			int count = 0;
			int n1=0,n2=0,n3=0;
			for (int j = 0; j < N; j++) {
				int no = in.nextInt();
				int div = no % 3;
				n1 = n2 = n3 = no/3;
				if (div==1)
					n3 = n3 + 1;
				if (div == 2)
					n2 = n3 = n3 + 1;
				
				if (n3 >= p)
					count++;
				else if (S != 0 && no >= 2) {
					if(n2 == n3) {
						n3 = n3 + 1;
						n2 = n2 - 1;
						if (n3 >= p) {
							count++;
							S--;
						}
					}						
				}
			}

			System.out.println("Case #" + (i + 1) + ": " + count);
		}
	}

}