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

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import java.util.Scanner;
import java.util.TreeMap;

public class Dance {
    public static void main(String[] args) throws Exception {
       BufferedReader br = new BufferedReader(new FileReader("B-large.in"));
       BufferedWriter bw = new BufferedWriter(new FileWriter("out.txt"));
       
       int T = Integer.parseInt(br.readLine().trim());
       
       for(int t = 1; t<=T; t++){
           String[] s = br.readLine().trim().split(" ");
           int N = Integer.parseInt(s[0]);
           int S = Integer.parseInt(s[1]);
           int P = Integer.parseInt(s[2]);
           int[] ps = new int[N];
           for(int i = 3; i < s.length; i++){
               ps[i-3] = Integer.parseInt(s[i]);
           }
           List<Integer[]> l = new ArrayList<Integer[]>();
           int res = 0;
           for(int p : ps){
               if(p == 0){
                   l.add(new Integer[]{0, 0, 0});
                   continue;
               }
               if(p%3 == 0){
                   if(p/3 >= P || p/3<=(P-2) || S<=0){
                        l.add(new Integer[]{p/3, p/3, p/3});
                   }else{
                       l.add(new Integer[]{p/3, p/3-1, p/3+1});
                       S--;
                   }
               }else if(p%3 == 1){
                   l.add(new Integer[]{p/3, p/3, p/3+1});
               }else{
                   if(p/3 == 9){
                       l.add(new Integer[]{p/3+1, p/3+1, p/3});
                   }else{
                       if(p/3 >= P || p/3<(P-2)){
                           l.add(new Integer[]{p/3+1, p/3+1, p/3});
                       }else{
                           if (S<=0){
                              l.add(new Integer[]{p/3+1, p/3+1, p/3});
                           }else{
                              l.add(new Integer[]{p/3, p/3, p/3+2});
                              S--;
                           }
                       }
                   }
               }
           }
//           
//           for(Integer[] arr: l) System.out.println(Arrays.toString(arr));
//           System.out.println("");
           
           for(Integer[] arr: l){
               if(arr[0]>=P || arr[1]>=P || arr[2]>=P){
                   res++;
               }
           }
           bw.write("Case #"+t+": "+res);
           bw.newLine();
       }
       
       br.close();
       bw.close();
    }
}
