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 cat.aubricoc.codejam;

import java.io.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.io.PrintWriter;

public class DancingWithTheGooglers {
	
	public static void main(String[] args) throws Exception {
		BufferedReader in = new BufferedReader(new FileReader(ClassLoader.getSystemResource("in.txt").getFile()));
		PrintWriter out = new PrintWriter(new File("C:/esilog/codejam/dancing-with-the-googlers/src/main/resources/out.txt"));
		int num = Integer.parseInt(in.readLine().trim());
		for (int iter = 0; iter < num; iter++) {
			String line = in.readLine();
			Integer sol = calculate(line);
			out.println("Case #" + (iter + 1) + ": " + sol);
		}
		in.close();
		out.flush();
		out.close();
	}

	private static Integer calculate(String line) {
		int n = 0;
		String[] nums = line.split(" ");
		int numGooglers = Integer.parseInt(nums[0].trim());
		int numSurpises = Integer.parseInt(nums[1].trim());
		int punts = Integer.parseInt(nums[2].trim());
		
		for (int iter = 0; iter < numGooglers; iter++) {
			int score = Integer.parseInt(nums[3 + iter].trim());
			int mid = score / 3;
			int res = score % 3;
			if (mid >= punts) {
				n++;
			} else {
				int diff = punts - mid;
				if (res == 0 && diff == 1 && numSurpises > 0 && mid > 0) {
					n++;
					numSurpises--;
				} else if (res == 1 && diff == 1) {
					n++;
				} else if (res == 2) {
					if (diff == 1) {
						n++;
					} else if (diff == 2 && numSurpises > 0) {
						n++;
						numSurpises--;
					}
				}
			}
		}
		
		return n;
	}
}
