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


public class BestResult 
{
	public int result(String input)throws Exception
	{
		String[] array= input.split(" ");
		int noOfGooglers = Integer.parseInt(array[0]);
		int surprising = Integer.parseInt(array[1]);
		int p = Integer.parseInt(array[2]);
		int x;
		int[] listOfBestResults = new int[noOfGooglers];
		int count = 0;
		for(int i=3;i<array.length;i++)
		{
			x = Integer.parseInt(array[i]);
			if(canItBeBestResult(x, p))
			{
				listOfBestResults[count] = x;
				count++;
			}
		}
		int bestResultCount = 0;
		for(int i=0;i<count;i++)
		{
			if(listOfBestResults[i]%3 == 2)
			{
				if(listOfBestResults[i]/3>=p)
				{
					System.out.println("list of best result w/o surprising " + listOfBestResults[i]);
					bestResultCount++;
				}
				
				else if((listOfBestResults[i]/3) + 2>=p && (listOfBestResults[i]/3) + 1>=p)
				{
					System.out.println("list of best result w/o surprising " + listOfBestResults[i]);
					bestResultCount++;
				}
				else if((listOfBestResults[i]/3) + 2>=p && surprising!=0)
				{
					System.out.println("list of best result surprising " + listOfBestResults[i]);
					bestResultCount++;
					surprising--;
				}
			}
			else if(listOfBestResults[i]%3 == 1 )
			{
				if(listOfBestResults[i]/3>=p)
				{
					System.out.println("list of best result w/o surprising " + listOfBestResults[i]);
					bestResultCount++;
				}
				else if((listOfBestResults[i]/3) + 1>=p)
				{
					System.out.println("list of best result w/o surprising " + listOfBestResults[i]);
					bestResultCount++;
				}
				else if((listOfBestResults[i]/3) + 1>=p && surprising!=0)
				{
					System.out.println("list of best result surprising " + listOfBestResults[i]);
					bestResultCount++;
					surprising--;
				}
			}
			else if( listOfBestResults[i]%3 == 0 )
			{
				if(listOfBestResults[i]/3>=p)
				{
					System.out.println("list of best result w/o surprising " + listOfBestResults[i]);
					bestResultCount++;
				}
				
				else if((listOfBestResults[i]/3) + 1>=p && surprising!=0)
				{
					System.out.println("list of best result surprising " + listOfBestResults[i]);
					bestResultCount++;
					surprising--;
				}
			}
			
		}
		return bestResultCount;
		
	}
	public boolean canItBeBestResult(int x, int p)
	{
		if(p==0)
		{
			return true;
		}
		if( x%3 == 2 && ((x/3)+2) >= p)
		{
			return true;
		}
		else if( x%3 == 1 && ((x/3)+1) >= p)
		{
			return true;
		}
		else if( x%3 == 0 && ((x/3)+1)>=p && x!=0)
		{
			return true;
		}
		
		return false;
	}
}
