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

import java.io.File;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Scanner;

public class DancingWithTheGooglers {

	public static int testGoal(int value, int goal) {
		int modResult = value % 3;
		int divResult = value / 3;
		/*
		 * x%3=0:(NS)x/3,(S)x/3+1;x%3=1:(NS)x/3+1,(S)x/3+1;x%3=2:(NS)x/3+1,(S)x/3
		 * +2;
		 */
		int nonSurpriseMax = (modResult == 0) ? divResult : (divResult + 1);
		int surpriseMax = (modResult <= 1) ? (divResult + 1) : (divResult + 2);
		surpriseMax = Math.min(10, surpriseMax);
		// some special checking
		if (value <= 1) {
			// no surprise
			surpriseMax = 0;
		}
		int goalResult = 0;
		if (nonSurpriseMax >= goal)
			goalResult++;
		if (surpriseMax >= goal)
			goalResult++;
		System.out.println(value + " : " + goalResult);
		return goalResult;
	}

	public static int eval(int supprise, int goal, int[] scores) {
		System.out.println("=== G:" + goal + " S:" + supprise + " - "
				+ Arrays.toString(scores));
		int[] goalTesting = new int[3];
		for (int score : scores) {
			goalTesting[testGoal(score, goal)]++;
		}
		System.out.println("--- " + Arrays.toString(goalTesting) + " => "
				+ (goalTesting[2] + Math.min(supprise, goalTesting[1])));
		return goalTesting[2] + Math.min(supprise, goalTesting[1]);
	}

	public static void main(String[] args) throws Exception {
		PrintWriter output = new PrintWriter("output2.txt");
		Scanner scanner = new Scanner(new File("input2.txt"));
		try {
			int input_T = scanner.nextInt();
			for (int i = 0; i < input_T; i++) {
				int input_N = scanner.nextInt();
				int input_S = scanner.nextInt();
				int input_p = scanner.nextInt();
				int[] scores = new int[input_N];
				for (int j = 0; j < input_N; j++) {
					scores[j] = scanner.nextInt();
				}
				output.printf("Case #%d: %d\n", i + 1,
						eval(input_S, input_p, scores));
			}
		} finally {
			output.close();
			scanner.close();
		}
	}

}
