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 codejam2012Qualification;
import java.io.*;
import java.util.*;
public class B {
	public static void main(String[] args)throws IOException {
		boolean large = false;
		large = true;
		String dir = "C://Users//Aayush//Desktop//";
		String InputFile = dir + (large ? "B-large.in" : "B-small-attempt0.in");
		String OutputFile = dir + (large ? "B-large.out" : "B-small.out");
		File file = new File(InputFile);
		Scanner st = new Scanner(file);
		FileWriter fw = new FileWriter(OutputFile);
		int T = st.nextInt();
		for(int cases = 1; cases <= T; cases++){
			int N = st.nextInt();
			int S = st.nextInt();
			int p = st.nextInt();
			int[] t = new int[N];
			for(int i = 0; i < N; i++){
				t[i] = st.nextInt();
			}
			int count = 0;
			for(int i = 0; i < N; i++){
				//a, b and are the scores allotted to googler a <= b <= c
				int a = t[i] / 3;
				int b = t[i] / 3;
				int c = t[i] / 3;
				if(t[i] % 3 == 0){
					if(c >= p)count++;
					else if(b > 0 && c == p - 1 && S > 0){
						S--;
						count++;
					}
				}else if(t[i] % 3 == 1){
					c += 1;
					if(c >= p)count++;
				}else if(t[i] % 3 == 2){
					c += 1;
					b += 1;
					if(c >= p)count++;
					else if(b > 0 && c == p - 1 && S > 0){
						S--;
						count++;
					}
				}
			}
			System.out.print("Case #" + cases + ": " + count);
			fw.write("Case #" + cases + ": " + count);

			System.out.println();
			fw.write("\n");

		}
		fw.flush();
		fw.close();

	}
}
