/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

/*
 * Dancing
 * Jason Bradley Nel
 * 16287398
 */
import java.io.*;

public class Dancing {

    public static void main(String[] args) {

        In input = new In("input.txt");
        int T = Integer.parseInt(input.readLine());

        for (int i = 0; i < T; i++) {
            System.out.printf("Case #%d: ", i + 1);
            int N = input.readInt();
            int s = input.readInt();
            int p = input.readInt();
            int c = 0;//counter for >=p cases
            //System.out.printf("N: %d, S: %d, P: %d, R: ", N, s, p);
            
            for (int j = 0; j < N; j++) {
                
                int score = input.readInt();
                int q = score / 3;
                int m = score % 3;
                //System.out.printf("%2d (%d, %d) ", scores[j], q, m);
                                
                switch (m) {
                    case 0:
                        if (q >= p) {
                            c++;
                        } else if (((q + 1) == p) && (s > 0) && (q != 0)) {
                            c++;
                            s--;
                        }
                        break;
                    case 1:
                        if (q >= p) {
                            c++;
                        } else if ((q + 1) == p) {
                            c++;
                        }
                        break;
                    case 2:
                        if (q >= p) {
                            c++;
                        } else if ((q + 1) == p) {
                            c++;
                        } else if (((q + 2) == p) && (s > 0)) {
                            c++;
                            s--;
                        }
                        break;
                }
            }
            //System.out.printf("Best result of %d or higher: ", p);
            System.out.println(c);
        }


    }
}

package fixjava;

import java.util.ArrayList;
import java.util.concurrent.Callable;
import java.util.concurrent.ExecutionException;
import java.util.concurrent.Future;

import fixjava.ParallelWorkQueue.CallableFactory;



public class ParallelWorkQueueTest {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		ArrayList<Integer> inputs = new ArrayList<Integer>();
		for (int i = 100; i < 120; i++)
			inputs.add(i);

		ParallelWorkQueue.CallableFactory<Integer, String> callableFactory = new CallableFactory<Integer, String>() {
			@Override
			public Callable<String> newInstance(final Integer input) {
				return new Callable<String>() {
					@Override
					public String call() throws Exception {
						Thread.sleep((int) (Math.random() * 4000));
						System.out.println("  Input: " + input);
						return "***" + (input + 1);
					}
				};
			}
		};

		try {
			for (Future<String> result : new ParallelWorkQueue<Integer, String>(4, inputs, callableFactory))
				System.out.println("Got : " + result.get());
		} catch (InterruptedException e) {
			e.printStackTrace();
		} catch (ExecutionException e) {
			e.printStackTrace();
		}
	}
}
