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

import java.io.File;
import java.io.FileNotFoundException;
import java.util.Scanner;

public class GoogleDancers 
{

	public static void main(String[] args) 
	{
		Scanner scan = null;
		try
		{
			scan = new Scanner(new File(args[0]));
		}
		catch (FileNotFoundException e)
		{
			System.err.println("File not found!");
			return;
		}
		if (!scan.hasNext())
		{
			System.err.println("Nothing in File!");
			return;
		}
		int testCases = Integer.parseInt(scan.nextLine());
		String[] line;
		String str;
		int theFabulousGoogleDancers;
		int soManySurprises;
		int whoIsBetterThanMe;
		int itsAStretch;
		int noSurpriseNeeded;
		int iAmBetterThanYou;
		int canReachWithSurprise;
		int number = 1;
		int combined;
		while (scan.hasNext())
		{
			System.out.print("Case #" + number + ": ");
			iAmBetterThanYou = 0;
			itsAStretch = 0;
			str = scan.nextLine();
			line = str.split(" ");
			theFabulousGoogleDancers = Integer.parseInt(line[0]);
			soManySurprises = Integer.parseInt(line[1]);
			whoIsBetterThanMe = Integer.parseInt(line[2]);
			noSurpriseNeeded = (whoIsBetterThanMe + (whoIsBetterThanMe-1) + (whoIsBetterThanMe-1));
			canReachWithSurprise = (whoIsBetterThanMe + (whoIsBetterThanMe-2) + (whoIsBetterThanMe - 2));
			if (whoIsBetterThanMe == 1)
			{
				noSurpriseNeeded = 1;
				canReachWithSurprise = 1;
			}
			if (whoIsBetterThanMe == 0)
			{
				noSurpriseNeeded = 0;
				canReachWithSurprise = 0;
			}
			for (int score = 3; score < line.length; score++)
			{
				if ((Integer.parseInt(line[score])) >= canReachWithSurprise && Integer.parseInt(line[score]) < noSurpriseNeeded)
				{
					itsAStretch++;
				}
				else if (Integer.parseInt(line[score]) >= noSurpriseNeeded)
				{
					iAmBetterThanYou++;
				}
			}
			if (itsAStretch <= soManySurprises)
			{
				combined = iAmBetterThanYou + itsAStretch;
			}
			else
			{
				combined = iAmBetterThanYou + soManySurprises;
			}

			System.out.print(combined);
			if(scan.hasNext())
			{
				System.out.println();
			}
			number++;
		}
	}

}
