/*
 * 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 codejam;

import java.util.ArrayList;
import java.util.Iterator;
import java.util.List;

import com.google.common.base.Splitter;

public class ProblemB extends CodeJamRunner {

	
	private int nrOfCases;
	private int testCaseIndex;
	int numberOfGooglers;
	int surprisingTriplets;
	int personalBestBar;
	int maxAbovePersonalBestBar;

	private List<Integer> totalPoints = new ArrayList<Integer>();

	public void process(int lineNr, String line) {
		if (lineNr == 1) {
			nrOfCases = Integer.valueOf(line);
			resetForNextCase();
		} else {
			Iterator<String> split = Splitter.on(" ").split(line).iterator();
			numberOfGooglers = Integer.parseInt(split.next());
			surprisingTriplets = Integer.parseInt(split.next());
			personalBestBar = Integer.parseInt(split.next());
			while ( split.hasNext() ) {
				totalPoints.add(Integer.parseInt(split.next()));
			}
			calc();
			write();
			resetForNextCase();
		}
	}

	private void write() {
		String resultLine = "Case #" + testCaseIndex + ": " + maxAbovePersonalBestBar;
		printlnOutput(resultLine);
	}

	private void calc() {
		int normalAboveCount = 0;
		int surpriseAboveCount = 0;
		for ( int i : totalPoints ) {
			Triplet t = new Triplet( i );
			if ( t.calcMaxNormal() >= personalBestBar ){
				normalAboveCount++;
			}
			else if ( t.calcMaxSurprise() >= personalBestBar ){
				surpriseAboveCount++;
			}
		}
		int surprisesHappened = Math.min(surpriseAboveCount, surprisingTriplets );
		maxAbovePersonalBestBar = normalAboveCount + surprisesHappened;
	}

	private void resetForNextCase() {
		testCaseIndex++;
		totalPoints.clear();
	}

	public static void main(String args[]) {
		ProblemB ao = new ProblemB();
		ao.run(args);
	}

}
