import java.io.BufferedWriter;
import java.io.File;
import java.io.FileOutputStream;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintStream;
import java.util.ArrayList;
import java.util.Scanner;


public class Dancing_With_the_Googlers {


    /**
     * The first line of the input gives the number of test cases, T.
     *  T test cases follow. 
     *  Each test case consists of a single line containing integers separated by single spaces. 
     *  The first integer will be N, the number of Googlers, and the second integer will be S, the number of surprising triplets of scores. 
     *  The third integer will be p, as described above. Next will be N integers ti: the total points of the Googlers. 
     * @throws IOException
     */
	   public static void main(String[] args) throws IOException {
	        // TODO Auto-generated method stub
			// Reading the input file
			Scanner in = new Scanner(new File("B-large.in"));
			// writting the input file
			FileOutputStream fos = new FileOutputStream("B-large.out");
			PrintStream out = new PrintStream(fos);
	         //Close the output stream
	        int testCase=Integer.parseInt(in.nextLine());
	        for(int i=0;i<testCase;i++) {
	        	out.print("Case #" + (i + 1) + ":\t");
	        	int NoOfGooglers= in.nextInt();
	        	int NoOfSurprisingResults = in.nextInt();
	        	int atLeastP=in.nextInt();
	        	ArrayList<Integer> scores= new ArrayList<Integer>();
        		int BestResults=0;
        		int Surprising=0;
	        	for(int j=0;j<NoOfGooglers;j++)
	        	{
	        		scores.add(in.nextInt());
	        		//System.out.print(scores.get(j));
	        		int modulus=scores.get(j)%3;
	        		int temp = scores.get(j);
	    			switch (modulus) {
					case 0:
						if (((temp / 3) >= atLeastP)) {
							BestResults++;
						} else {
							if (((((temp / 3) + 1) >= atLeastP) && ((temp / 3) >= 1))
									&& (Surprising < NoOfSurprisingResults)) {
								BestResults++;
								Surprising++;
								
							}
							System.out.println("Case 0"+"itr:"+i+"  surprising:"+temp);
						}
						
						break;
					case 1:
						if ((temp / 3) + 1 >= atLeastP) {
							BestResults++;
							continue;
						}
						
						break;
					case 2:
						if ((temp / 3) + 1 >= atLeastP) {
							BestResults++;
						} else {
							if (((temp / 3) + 2 >= atLeastP)
									&& (Surprising < NoOfSurprisingResults)) {
								BestResults++;
								Surprising++;
							}
							System.out.println("Case 2"+"itr:"+i+"  surprising:"+temp);
						}
						break;
					default:
						System.out.println("Error");
					}
	    			
				}// Internal for
				out.println(BestResults);
				// System.out.println(BestResults);
				System.out.println(Surprising);
				BestResults = 0;
			}// for
			in.close();
			out.close();
			fos.close();

	   }
}

package probs;

import java.io.File;
import java.io.FileNotFoundException;
import java.util.ArrayList;
import java.util.List;
import java.util.Map;
import java.util.Scanner;
import java.util.TreeMap;

public class Problem2 {

	public static void main(String[] args) {

		try {

			String filePath = "in-large-2.txt";

			List<String> input = readInput(filePath);
			int[] output = process(input);
			writeOutput(output);

		} catch (Exception e) {
			e.printStackTrace();
		}
	}

	private static int[] process(List<String> input) {

		int[] result = new int[input.size()];
		int count = 0;
		for (String eachLine : input) {
			String[] split = eachLine.split(" ");
			int googlers = Integer.parseInt(split[0]);
			int surprisesAllowed = Integer.parseInt(split[1]);
			int criteriaBestScore = Integer.parseInt(split[2]);
			int[] totals = new int[googlers];
			for (int i = 0; i < googlers; i++) {
				totals[i] = Integer.parseInt(split[i + 3]);
			}
			int maxGooglersWithAtleaseRequiredBestResult = processEachTestCase(surprisesAllowed, criteriaBestScore, totals);
			result[count] = maxGooglersWithAtleaseRequiredBestResult;

			count++;
		}

		return result;
	}

	private static int processEachTestCase(int surprisesAllowed,
			int bestScore, int[] totals) {

		int result = 0;

		final int max=10;
		final int doubleMax = max*2;
		
		int maxRange = 2*(bestScore+1);
		int minRange = 2*(bestScore-1);
		if (maxRange>doubleMax) {
			maxRange=doubleMax;
		}
		if (minRange<0) {
			minRange=0;
		}

		int furtherMaxRange = 2*(bestScore+2);
		int furtherMinRange = 2*(bestScore-2);
		if (furtherMaxRange>doubleMax) {
			furtherMaxRange=doubleMax;
		}
		if (furtherMinRange<0) {
			furtherMinRange=0;
		}

		int surpriseCounter=0;

		for (int i = 0; i < totals.length; i++) {

			int eachTotal = totals[i];

			if (eachTotal>=3*bestScore) { // 333 to infinity
				result++;
			}else{			
				if(eachTotal>=(bestScore+minRange) && eachTotal<=(bestScore+maxRange)){ // 322 to 344
					result++;
				}else{
					if(eachTotal<(bestScore+minRange) && eachTotal>=(bestScore+furtherMinRange)){ // 311 to 321
						if (surpriseCounter<surprisesAllowed) {
							result++;
							surpriseCounter++;
						}
					}else if(eachTotal>(bestScore+maxRange) && eachTotal<=(bestScore+furtherMaxRange)){ // 345 to 355
						if (surpriseCounter<surprisesAllowed) {
							result++;
							surpriseCounter++;
						}
					}
				}
			}
		}
		
		return result;
	}

	private static List<String> readInput(String filePath)
	throws FileNotFoundException {

		List<String> list = new ArrayList<String>();

		File file = new File(filePath);
		Scanner scanner = new Scanner(file);
		if (scanner.hasNextLine()) {
			String line = scanner.nextLine();
			int testCases = Integer.parseInt(line);

		}
		while (scanner.hasNextLine()) {
			String line = scanner.nextLine();
			//System.out.println(line);
			list.add(line);
		}

		return list;
	}

	private static void writeOutput(int[] list) {

		int n = list.length;

		for (int i = 0; i < n; i++) {
			System.out.println("Case #" + (i + 1) + ": " + list[i]);
		}
	}

}
