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 edu.gcj.solutions;

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

public class DancingGooglers {
	/**
	 * @param args
	 * @throws IOException 
	 * @throws NumberFormatException 
	 */
	public static void main(String[] args) throws NumberFormatException, IOException {
		Scanner inf = new Scanner(new File("C:\\Users\\Coltin\\Downloads\\B-large.in"));
		
		int T = inf.nextInt();
		System.out.println(T);
		
		for (int t = 0; t < T; t++) {
			int N = inf.nextInt(); // Number of googlers
			int S = inf.nextInt(); // Number of surprisingly triplets
			int p = inf.nextInt(); // Max score we want to find in a triplet

			int results = 0;
			for (int n = 0; n < N; n++) { // We can calculate googlers scores independently, so 1 at a time
				int googlerScore = inf.nextInt();
				//System.out.print("Googler Score: " + googlerScore + "   p=" + p);
				if (p == 0) {
					results++;
					continue;
				} else if (googlerScore == 0) {
					continue;
				} else if (Maximize(googlerScore) >= p) {
					//System.out.println("   Maximized");
					results++;
				} else if ((S > 0) && (MaximizeSurprising(googlerScore) >= p)) {
					//System.out.println("   MaximizedSURPRISE");
					S -= 1;
					results++;
				} else {
					//System.out.println("   NONE");
				}
			}
			System.out.println("Case #" + (t+1) + ": " + results);
		}
	}

	private static int MaximizeSurprising(int googlerScore) {
		int perJudge = googlerScore/3;
		int pointsRemaining = googlerScore - (perJudge*3);
		if (pointsRemaining == 2) {
			return perJudge+2;
		}
		return perJudge+1;
	}

	private static int Maximize(int googlerScore) {
		int perJudge = googlerScore/3;
		int pointsRemaining = googlerScore - (perJudge*3);
		if (pointsRemaining == 0) {
			return perJudge;
		}
		return perJudge+1;
	}
}
