package code12.qualification;

import java.io.File;
import java.io.FileWriter;
import java.util.Scanner;

public class B {
	public static String solve(int N, int S, int p, int[] t) {
		
		// 3a 		-> (a, a, a), *(a - 1, a, a + 1)
		// 3a + 1	-> (a, a, a + 1), *(a - 1, a + 1, a + 1)
		// 3a + 2	-> (a, a + 1, a + 1), *(a, a, a + 2)
		
		int numPNoS = 0;
		int numPWithS = 0;
		
		for (int i = 0; i < N; i++) {
			int a = (int)Math.floor(t[i] / 3);
			int r = t[i] % 3;
			
			switch (r) {
			case 0:
				if (a >= p) {
					numPNoS++;
				} else if (a + 1 >= p && a - 1 >= 0) {
					numPWithS++;
				}
				break;
			case 1:
				if (a >= p || a + 1 >= p) {
					numPNoS++;
				}
				break;
			case 2:
				if (a >= p || a + 1 >= p) {
					numPNoS++;
				} else if (a + 2 >= p) {
					numPWithS++;
				}
				break;
			}
		}
		
		return "" + (numPNoS + Math.min(S, numPWithS));
	}

	public static void main(String[] args) throws Exception {
		// file name
		//String fileName = "Sample";
		//String fileName = "B-small";
		String fileName = "B-large";
		
		// file variable
		File inputFile = new File(fileName + ".in");
		File outputFile = new File(fileName + ".out");
		Scanner scanner = new Scanner(inputFile);
		FileWriter writer = new FileWriter(outputFile);

		// problem variable
		int totalCase;
		int N, S, p;
		int[] t;

		// get total case
		totalCase = scanner.nextInt();

		for (int caseIndex = 1; caseIndex <= totalCase; caseIndex++) {
			// get input
			N = scanner.nextInt();
			S = scanner.nextInt();
			p = scanner.nextInt();
			t = new int[N];
			
			for (int i = 0; i < N; i++) {
				t[i] = scanner.nextInt();
			}
			
			String output = "Case #" + caseIndex + ": " + solve(N, S, p, t);
			System.out.println(output);
			writer.write(output + "\n");
		}
		scanner.close();
		writer.close();
	}
}

package DancingWithGooglers;

import java.io.BufferedReader;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.util.Arrays;

public class MainProcess {

	/**
	 * @param args
	 */
	
	private Googler[] googlers ;
	
	public MainProcess(File f){
		readFile(f);
	}
	
	private void readFile(File f){
		
		int numCase = 0;
		int numGoogler = 0;
		int numSurprising = 0;
		int p = 0;
		
		try {
			FileReader fr = new FileReader(f);
			BufferedReader br = new BufferedReader(fr);
			
			String str = "";
			
			if( (str = br.readLine())!=null){
				numCase = Integer.parseInt(str);
			}
			
			int count = 0;
			while( count < numCase){
				str = br.readLine();
				String[] substr = str.split(" ");
				
				numGoogler = Integer.parseInt(substr[0]);
				googlers = new Googler[numGoogler];
								
				numSurprising = Integer.parseInt(substr[1]);
				
				p = Integer.parseInt(substr[2]);
				
				for(int i=0 ; i< numGoogler ; i++){
					
					int totalScore = Integer.parseInt(substr[i+3]);
					googlers[i] = new Googler(totalScore);
				}
				
				Arrays.sort(googlers);
				findMaxNum(count ,numSurprising , p);
				
				count++;
			}
			
		} catch (FileNotFoundException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}
		
	}
	
	private void findMaxNum(int count , int numSurprising , int p){
		int numMax = 0;
		
		for(int i=0 ; i< googlers.length ; i++){
			if(numSurprising >0){
								
				int maxScore = googlers[i].getMax(true);
				if(maxScore >= p ){
					numMax++;
					numSurprising--;
				}
			}
			else{
				int maxScore = googlers[i].getMax(false);
				if(maxScore >= p ){
					numMax++;
				}
			}
		}
		
		System.out.println("Case #" + (count+1) + ": " + numMax);
	}
	
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		File f = new File(".\\src\\DancingWithGooglers\\B-large.in");
		MainProcess m = new MainProcess(f);
	}

}
