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

import java.io.File;
import java.io.IOException;
import java.util.ArrayList;
import java.util.Scanner;

public class DancingWithTheGooglers {

	// Input
	//
	// 4
	// 3 1 5 15 13 11
	// 3 0 8 23 22 21
	// 2 1 1 8 0
	// 6 2 8 29 20 8 18 18 21
	//
	// 1 â¤ T â¤ 100.
	// 0 â¤ S â¤ N.
	// 0 â¤ p â¤ 10.
	// 0 â¤ ti â¤ 30.
	// At least S of the ti values will be between 2 and 28, inclusive.

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		try {
			Scanner scan = new Scanner(
					new File(
							"D:\\eclipse\\Ghani\\GCJ\\src\\qualification\\dancingWithTheGooglers\\B-large.in"));
			// new File(
			// "D:\\eclipse\\Ghani\\GCJ\\src\\qualification\\dancingWithTheGooglers\\test.txt"));
			try {
				int nbCas = Integer.parseInt(scan.nextLine());
				String result = new String();
				for (int i = 0; i < nbCas; i++) {
					int nbG = scan.nextInt();
					int nbS = scan.nextInt();
					int p = scan.nextInt();

					ArrayList<Integer> scores = new ArrayList<Integer>();

					for (int j = 0; j < nbG; j++) {
						scores.add(scan.nextInt());
					}

					int reponse = bestResult(scores, nbS, p);
					result += printCase(i, reponse);
				}
				System.out.print(result);
			} finally {
				scan.close();
			}
		} catch (IOException ioe) {
			System.out.println("Erreur --" + ioe.toString());
		}

	}

	private static int bestResult(ArrayList<Integer> scores, int nbS, int p) {
		int result = 0;
		int surprising = 0;
		if (p > 0 && p < 30) {
			for (Integer integer : scores) {
				// System.out.println(integer);
				if (integer < (3 * (p - 1)) - 1 || integer == 0) {
					result += 0;
					// System.out.println("aucun");
				} else if (integer >= (3 * p) - 2) {
					result += 1;
					// System.out.println("tous");
				} else {
					surprising += 1;
					// System.out.println("Ã§a depend");
				}

			}
			result += Math.min(surprising, nbS);
		} else if (p == 10) {
			for (Integer integer : scores) {
				if (integer == 30) {
					result += 1;
				}
			}
		} else {
			result = scores.size();
		}
		return result;
	}

	public static String printCase(int i, int reponse) {

		String ligne = "Case #" + (i + 1) + ": " + reponse + "\n";
		return ligne;
	}

}
