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 net.anzix.learn.codejam.qr12;

import java.io.File;
import java.io.FileInputStream;
import java.io.InputStream;
import java.io.PrintStream;
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;

public class DancingWithTheGooglers {

	private InputStream input;
	private PrintStream output;

	public DancingWithTheGooglers() {

	}

	public DancingWithTheGooglers(InputStream input, PrintStream output) {
		super();
		this.input = input;
		this.output = output;
	}

	public DancingWithTheGooglers(File inputFile, File outputFile)
			throws Exception {
		this.input = new FileInputStream(inputFile);
		output = new PrintStream(outputFile);

	}

	public void run() throws Exception {
		Scanner scanner = new Scanner(input);
		int lines = scanner.nextInt();
		for (int i = 0; i < lines; i++) {
			int n = scanner.nextInt();
			int s = scanner.nextInt();
			int p = scanner.nextInt();
			List<Integer> maxs = new ArrayList<Integer>();
			for (int j = 0; j < n; j++) {
				maxs.add(scanner.nextInt());
			}
			output.println("Case #" + (i + 1) + ": "
					+ getNoOfBigger(maxs, s, p));
		}
		output.close();
	}

	public static void main(String[] args) {
		try {
			new DancingWithTheGooglers(new File(args[0]), new File(args[1]))
					.run();
		} catch (Exception e) {
			e.printStackTrace();
		}
	}

	public int getNoOfBigger(List<Integer> maxPoints, int noOfSuprisings,
			int limit) {
		int no = 0;
		for (Integer point : maxPoints) {
			if (point == 0) {
				if (limit == 0) {
					no++;
				}
			} else {
				int ns = maxNo(point, false);
				int s = maxNo(point, true);
				if (noOfSuprisings < 1 && ns >= limit) {
					no++;
				}
				if (noOfSuprisings > 0) {
					if (ns < limit && s >= limit) {
						noOfSuprisings--;
						no++;
					} else if (ns >= limit) {
						no++;
					}

				}
			}

		}

		return no;

	}

	public int maxNo(int sumPoint, boolean suprising) {
		int c = sumPoint % 3;
		if (suprising) {
			switch (c) {
			case 0:
				return (sumPoint + 3) / 3;
			case 1:
				return (sumPoint + 2) / 3;
			case 2:
				return (sumPoint + 4) / 3;
			}
		} else {
			switch (c) {
			case 0:
				return (sumPoint + 0) / 3;
			case 1:
				return (sumPoint + 2) / 3;
			case 2:
				return (sumPoint + 1) / 3;
			}
		}
		throw new IllegalArgumentException();
	}
}
