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 com.khajochi.codejam;

import java.io.BufferedReader;
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Arrays;

public class DancingWithTheGooglers
{

	/**
	 * @param args
	 */
	public static void main(String[] args)
	{
		try
		{
			RecycledNumbers sp = new RecycledNumbers();

			FileInputStream fstream = new FileInputStream("/Users/msmart/Documents/My Work/Workspace/M/resource/2012round1/1BSmall.in");
			DataInputStream in = new DataInputStream(fstream);
			BufferedReader br = new BufferedReader(new InputStreamReader(in));
			String str = br.readLine();
			int count = 1;
			while ((str = br.readLine()) != null)
			{
//				System.out.println(str);
				
				String[] strSpilt = str.split(" ");
				
				int numInput = Integer.parseInt(strSpilt[0]);
				int numSurprise = Integer.parseInt(strSpilt[1]);
				int sum = Integer.parseInt(strSpilt[2]);
				
				int[] allInput = new int[numInput];
				
				for (int i = 0; i < numInput; i++)
				{
					allInput[i] = Integer.parseInt(strSpilt[i+3]);
//					System.out.println(allInput[i]);
				}
				
				int ans = 0;
				
				Arrays.sort(allInput);
				
				for (int i = 0; i < allInput.length; i++)
				{
					if ( allInput[i] >= sum * 3 )
					{
						ans++;
						continue;
					}
					
					if ( sum * 3 - 2 < 0 )
					{
						continue;
					}
					else if (allInput[i] >= sum * 3 - 2 )
					{
						ans++;
						continue;
					}
					
					if ( sum * 3 - 4 < 0 )
					{
						continue;
					}
					else if (allInput[i] >= sum * 3 - 4 && numSurprise > 0 )
					{
						ans++;
						numSurprise--;
						continue;
					}
					
				}
//				System.out.println(ans);
				
				System.out.println("Case #" + count++ + ": " + ans);
				
			}
			in.close();
		}
		catch (Exception e)
		{
			System.err.println(e);
		}
	
	}

}
