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

import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.PrintStream;
import java.util.Scanner;
/**
 * @author alei
 */
public class B {
    public static void main(String[]Args) throws FileNotFoundException{
        Scanner sn = new Scanner(new FileInputStream("B.in"));
        System.setOut(new PrintStream("B.out"));
        int nCases = sn.nextInt();        
        for(int i=0;i<nCases;i++){
            sn.nextLine();
            int N = sn.nextInt();
            int S = sn.nextInt();
            int P = sn.nextInt();
            int[]totalPoints = new int[N];
            for(int j=0;j<N;j++){
                totalPoints[j] = sn.nextInt();                
            }
            int result = solve(totalPoints,S,P);
            System.out.println("Case #"+(i+1)+": "+result);
        }
                
    }
    public static int solve(int[]totalPoints,int S,int P){
        int m = 0;
        int min = 3*P-4;
        min = min<0?P:min+0;        //the right
        //min = min<0?0:min+0;
        int max = 3*P+4;
        //System.out.println("["+min+";"+max+"]");
                
        int c=0,a=0,ssp=0,sns=0;
        int gigants = 0;
        
        int s1 = 3*P-4;
        int s2 = 3*P-3;
        int s3 = 3*P+3;
        int s4 = 3*P+4;
        for(int i=0;i<totalPoints.length;i++){
            int point = totalPoints[i];
            if(point<=max && point>=min){
                m++;
                if(point==s1 || point==s2||point==s3||point==s4){
                    int n1 = (point+2)/3;
                    if(n1>=P){
                        //System.out.println("sns++->"+point);
                        sns++;
                    }
                    c++;
                }
                else{
                    int n1 = (point+2)/3;
                    if(n1>=P){
                        ssp++;
                    }
                }
            }
            else if(point >max){
                gigants++;
                m++;
            }
            else{
                a++;
            }
        }
        //System.out.println("m->"+m+"->gig->"+gigants+"->a->"+a+"->S->"+S+"->c->"+c+"<->nsp->"+ssp);
                
        if(S>c){
            S-=c;
            if(S>0){
                S-=gigants;
                if(S>0){
                   S-=a;
                   if(S>0){
//                       System.out.println("finalSubst->"+m+"-s:"+S);
                       int reaNsp = Math.min(S, ssp);
                       m = m-S+reaNsp;
                   }
                }
            }            
        }
        else{            
            //sns = Math.min(S, sns);
            int fns = c-S;
            //System.out.println("fns->"+fns+"<->sns->"+sns);
            if(sns>=fns){
                
            }
            else{
                m = m - fns + sns;
            }
        }
        
        return m;
    }
}
