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 qualification.problemb;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.ArrayList;
import java.util.List;

public class ProblemB {

	private class Data {
		
		private int surpricing;
		private int minPoints;
		private List<Integer> points = new ArrayList<Integer>();
		
		public int getSurpricing() {
			return surpricing;
		}
		public void setSurpricing(int surpricing) {
			this.surpricing = surpricing;
		}
		public int getMinPoints() {
			return minPoints;
		}
		public void setMinPoints(int minPoints) {
			this.minPoints = minPoints;
		}
		public List<Integer> getPoints() {
			return points;
		}
		public void setPoints(List<Integer> points) {
			this.points = points;
		}
		
	}
	
	private List<Data> readFile(File f) {
		String nextLine = null;
		List<Data> result = null;

		try {
			BufferedReader reader = new BufferedReader(new FileReader(f));

			while ((nextLine = reader.readLine()) != null) {
				if (result == null) {
					result = new ArrayList<Data>();
				} else {
					String[] line = nextLine.split(" ");
					Data d = new Data();
					d.setSurpricing(Integer.parseInt(line[1]));
					d.setMinPoints(Integer.parseInt(line[2]));
					
					List<Integer> points = new ArrayList<Integer>();
					for(int i = 0; i < Integer.parseInt(line[0]); i++) {
						d.getPoints().add(Integer.parseInt(line[i + 3]));
					}
					
					result.add(d);
				}
			}

			reader.close();
		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}

		return result;

	}

	private List<Integer> solve(List<Data> data) {
		List<Integer> winners = new ArrayList<Integer>();
		for(Data d : data) {
			winners.add(getMaxWinnerForList(d));
		}
		
		return winners;
	}
	
	private int getMaxWinnerForList(Data data) {
		int winners = 0;
		int surpricing = 0;
		
		for(int point : data.getPoints()) {
			if(point < data.getMinPoints()) {
				continue;
			}
			
			if(point >= 3 * data.getMinPoints() - 2) {
				winners++;
			} else if(point >= 3 * data.getMinPoints() - 4) {
				surpricing++;
			}
		}
		
		winners += Math.min(data.getSurpricing(), surpricing);

		return winners;
	}
	
	private void writeToDisk(List<Integer> output) {
		File f = new File("outputBlarge.txt");
		
		try {
			BufferedWriter writer = new BufferedWriter(new FileWriter(f));
			int counter = 1;
			for(int s : output) {
				writer.write("Case #" + counter + ": " + s + "\n");
				counter++;
			}
			writer.close();
		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		} 
		
	}

	
	public static void main(String[] args) {
		ProblemB c = new ProblemB();
		List<Data> structures = c.readFile(new File(args[0]));
		List<Integer> longs = c.solve(structures);
		c.writeToDisk(longs);
	}

	
}
