import java.io.BufferedWriter;
import java.io.File;
import java.io.FileOutputStream;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintStream;
import java.util.ArrayList;
import java.util.Scanner;


public class Dancing_With_the_Googlers {


    /**
     * The first line of the input gives the number of test cases, T.
     *  T test cases follow. 
     *  Each test case consists of a single line containing integers separated by single spaces. 
     *  The first integer will be N, the number of Googlers, and the second integer will be S, the number of surprising triplets of scores. 
     *  The third integer will be p, as described above. Next will be N integers ti: the total points of the Googlers. 
     * @throws IOException
     */
	   public static void main(String[] args) throws IOException {
	        // TODO Auto-generated method stub
			// Reading the input file
			Scanner in = new Scanner(new File("B-large.in"));
			// writting the input file
			FileOutputStream fos = new FileOutputStream("B-large.out");
			PrintStream out = new PrintStream(fos);
	         //Close the output stream
	        int testCase=Integer.parseInt(in.nextLine());
	        for(int i=0;i<testCase;i++) {
	        	out.print("Case #" + (i + 1) + ":\t");
	        	int NoOfGooglers= in.nextInt();
	        	int NoOfSurprisingResults = in.nextInt();
	        	int atLeastP=in.nextInt();
	        	ArrayList<Integer> scores= new ArrayList<Integer>();
        		int BestResults=0;
        		int Surprising=0;
	        	for(int j=0;j<NoOfGooglers;j++)
	        	{
	        		scores.add(in.nextInt());
	        		//System.out.print(scores.get(j));
	        		int modulus=scores.get(j)%3;
	        		int temp = scores.get(j);
	    			switch (modulus) {
					case 0:
						if (((temp / 3) >= atLeastP)) {
							BestResults++;
						} else {
							if (((((temp / 3) + 1) >= atLeastP) && ((temp / 3) >= 1))
									&& (Surprising < NoOfSurprisingResults)) {
								BestResults++;
								Surprising++;
								
							}
							System.out.println("Case 0"+"itr:"+i+"  surprising:"+temp);
						}
						
						break;
					case 1:
						if ((temp / 3) + 1 >= atLeastP) {
							BestResults++;
							continue;
						}
						
						break;
					case 2:
						if ((temp / 3) + 1 >= atLeastP) {
							BestResults++;
						} else {
							if (((temp / 3) + 2 >= atLeastP)
									&& (Surprising < NoOfSurprisingResults)) {
								BestResults++;
								Surprising++;
							}
							System.out.println("Case 2"+"itr:"+i+"  surprising:"+temp);
						}
						break;
					default:
						System.out.println("Error");
					}
	    			
				}// Internal for
				out.println(BestResults);
				// System.out.println(BestResults);
				System.out.println(Surprising);
				BestResults = 0;
			}// for
			in.close();
			out.close();
			fos.close();

	   }
}

package qualification;

import java.io.*;

public class Bsmall {
	public static void main(String[] args) throws IOException {
		BufferedReader br = new BufferedReader(new FileReader("./src/qualification/B-large.in"));
		BufferedWriter bw = new BufferedWriter(new FileWriter("./src/qualification/B-large.out"));
		int[][] inputs = new int[100][103];
		int casenumber = 0;
		String input = null;
		int total = 0;
		while((input=br.readLine()) != null)
		{
			if(casenumber==0)
			{
				total = Integer.parseInt(input);
			}else{
				String[] array = input.split(" ");
				// N
				inputs[casenumber-1][0] = Integer.parseInt(array[0]);
				// S
				inputs[casenumber-1][1] = Integer.parseInt(array[1]);
				// p
				inputs[casenumber-1][2] = Integer.parseInt(array[2]);
				// N integers ti.
				for(int i=3;i<array.length;i++)
				{
					inputs[casenumber-1][i] = Integer.parseInt(array[i]);
				}
			}
			casenumber++;
		}
		casenumber=1;
		while(casenumber <= total)
		{
			//System.out.println("Case #" + casenumber + ": " + String.valueOf(surprisingTriplets(inputs[casenumber-1], bw)));
			bw.write("Case #" + casenumber + ": " + String.valueOf(surprisingTriplets(inputs[casenumber-1], bw)));
			bw.newLine();
			casenumber++;
		}
		bw.close();
	}
	
	public static int surprisingTriplets(int[] inputs, BufferedWriter bw) throws IOException
	{
		int n = inputs[0];
		int s = inputs[1];
		int p = inputs[2];
		
		int sum=0;
		int count=0;
		int used=0;
		int i = 0;
		while(i<n)
		{
			sum=inputs[i+3];
			if(sum==0 && p==0){
				count++;
			}else if(sum!=0){
				int[] triplets = new int[3];
				triplets[0]=sum/3;
				triplets[1]=sum/3;
				triplets[2]=sum/3;
				if(triplets[0]>=p)
				{
					count++;
				}else if(sum%3==2)
				{
					if(triplets[0]==(p-2) && (s-used>0))
					{
						triplets[0]+=2;
						used++;
						count++;
					}else{
						triplets[0]++;
						triplets[1]++;
						if(triplets[0]>=p)
						{
							count++;
						}
						
					}
				}else if(sum%3==1)
				{
					triplets[0]++;
					if(triplets[0]>=p)
					{
						count++;
					}
				}else if(sum%3==0)
				{
					if(s-used>0 && triplets[0]==p-1)
					{
						triplets[0]++;
						triplets[2]--;
						used++;
						count++;
					}
				}
			}
			i++;
		}
		return count;
	}
}
