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 qualifying;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.nio.charset.Charset;
import java.util.ArrayList;
import java.util.Collection;
import java.util.Collections;
import java.util.List;

/**
 * Google Code Jam, Problem B. Result finder
 * 
 * @author Petar
 * 
 */
public class Dancers {
	private static BufferedReader in;
	private static BufferedWriter out;

	/**
	 * Main, reads in scores, outputs max num of Googler's with result p
	 * 
	 * @param args
	 */
	public static void main(String[] args) {
		List<Integer> scores;
		int numSurprise, numGooglers, p, maxGooglers;
		String currLine = "";

		try {
			out = new BufferedWriter(new FileWriter(".out"));
			in = new BufferedReader(new FileReader(".in"));
			int testNum = Integer.parseInt(in.readLine());
			for (int i = 0; i < testNum; i++) {
				maxGooglers = 0;
				currLine = in.readLine();
				String[] testBound = currLine.split(" ");

				numGooglers = Integer.parseInt(testBound[0]);
				numSurprise = Integer.parseInt(testBound[1]);
				p = Integer.parseInt(testBound[2]);
				System.out
						.println(String
								.format("The bounds of the problem are %d googlers, %d surprising results and %d p value",
										numGooglers, numSurprise, p));
				// Read in the scores
				scores = new ArrayList<Integer>(numGooglers);

				for (int j = 0; j < numGooglers; j++) {
					scores.add(Integer.parseInt(testBound[j + 3]));
				}

				// Determine the tallies
				for (Integer score : scores) {
					if (score < (3 * p - 4) || score < p) {
						continue;
					} else if (score >= (3 * p - 2)) {
						maxGooglers++;
					} else {
						if (numSurprise > 0) {
							maxGooglers++;
							numSurprise--;
						}
					}
				}

				Collections.sort(scores);

				out.write(String.format("Case #%d: %d", i + 1, maxGooglers));
				out.newLine();
			}

			in.close();
			out.flush();
			out.close();
		} catch (FileNotFoundException e) {
			System.err.println("Input file was not found");
		} catch (IOException e) {
			System.err.println("Problem reading from input file");
			e.printStackTrace();
		}
	}
}
