/*
 * 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 hk.polyu.cslhu.codejam;

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

import org.apache.log4j.Logger;

import hk.polyu.cslhu.codejam.lib.FileStream;
import hk.polyu.cslhu.codejam.lib.ResultCollector;
import hk.polyu.cslhu.codejam.solution.Solution;
import hk.polyu.cslhu.codejam.solution.impl.StoreCredit;
import hk.polyu.cslhu.codejam.solution.impl.qualificationround.DancingWithTheGooglers;
import hk.polyu.cslhu.codejam.solution.impl.qualificationround.SpeakingInTongues;
import hk.polyu.cslhu.codejam.thread.JamThreadManager;

/**
 * Hello world!
 *
 */
public class App 
{
	public static Logger logger = Logger.getLogger(App.class);
	
	public List<List<String>> getTestCaseList(String filePath) {
		List<List<String>> testCaseList = new ArrayList<List<String>>();
		List<String> content = FileStream.read(filePath);
		logger.info("The amount of lines: " + content.size());
		logger.info("The amount of test cases: " + content.get(0));
		
		for (int i = 1; i < content.size(); i++)
			testCaseList.add(content.subList(i, i + 1));
		
		return testCaseList;
	}
	
    public static void main( String[] args )
    {
    	String filePath = "C:\\Users\\Allen HU\\Dropbox\\Misc\\B-small-attempt0.in";
    	String resultFile = filePath + ".result";
    	String resultPattern = "Case #" + ResultCollector.IndexPartInRow + ": " + ResultCollector.ResultPartInRow + "\n";
    	boolean allowMultiThreads = false;
    	
    	List<List<String>> testCaseList = new App().getTestCaseList(filePath);
    	
    	Solution solution = new DancingWithTheGooglers();
    	
        JamThreadManager jtm = new JamThreadManager(solution, testCaseList, resultFile, resultPattern, allowMultiThreads);
        try {
			jtm.runThreads();
		} catch (CloneNotSupportedException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}
    }
}
