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

import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.util.Scanner;

/**
 *
 * @author amahdy
 */
public class GCJ_QR_B {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) throws FileNotFoundException, IOException {
        new GCJ_QR_B().start();
    }
    
    private void start() throws FileNotFoundException, IOException {

        Scanner in = new Scanner(
                new FileReader("/home/amahdy/b-large.in"));
        int x = in.nextInt();
        in.nextLine();
        
        for (int i = 0; i < x; ) {
            
            int N = in.nextInt();
            int S = in.nextInt();
            int p = in.nextInt();
            int[] t = new int[N];
            for(int j=0; j<N; j++) {
                t[j] = in.nextInt();
            }
            int max=0;
            for(int j=0; j<N; j++) {
                if(t[j]==0) {
                    if(p==0) {
                        max++;
                    }
                    continue;
                }
                int min = t[j]/3;
                int diff = t[j] - (3*min);
                
                switch (diff) {
                    case 0:
                        if(min>=p) {
                            max++;
                        }else if(min+1==p && S>0) {
                            S--;
                            max++;
                        }
                        break;
                    case 1:
                        if(min<10 && min+1>=p) {
                            max++;
                        }
                        break;
                    case 2:
                        if(min<10 && min+1>=p) {
                            max++;
                        }else if(min<9 && min+2==p && S>0) {
                            S--;
                            max++;
                        }
                        break;
                }
            }
            System.out.println("Case #" + ++i + ": " + max);
        }
    }
}
