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

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.DataInputStream;
import java.io.File;
import java.io.FileInputStream;
import java.io.FileWriter;
import java.io.InputStreamReader;

public class DancingWiththeGooglers {

	/**
	 * @param args
	 */
	
	public static void writeToFile(String text) {
        try {
                BufferedWriter bw = new BufferedWriter(
                		new FileWriter(new File("C:\\B-large.out"), true));
                bw.write(text);
                bw.newLine();
                bw.close();
        } catch (Exception e) {
        }
}
	
	static int[] detail(String ch){
		int N=0;
		if(ch.charAt(1)==' ') N=Integer.parseInt((String) ch.subSequence(0, 1))            ;
		else if(ch.charAt(2)==' ') N=Integer.parseInt( (String) ch.subSequence(0, 2))            ;
		else N=Integer.parseInt((String) ch.subSequence(0, 3))            ;
		//System.out.println("N     "+N);

		String dh ="";
		int[] tab=new int[N+3];
		int t=0;
		for(int i=0;i<ch.length();i++){
			if(ch.charAt(i)==' ') { 
				tab[t]=  Integer.parseInt(dh)            ;
				dh="";
				t++;
			}
			else
			dh=dh+ch.charAt(i);
		}
		tab[t]= Integer.parseInt(dh) ;
				//for(int i=0;i<tab.length;i++)
		//System.out.println(tab[i]);

		return tab;
		
	}
	public static void main(String[] args) {
		// TODO Auto-generated method stub
         
		try{
			 
			  FileInputStream fstream = new FileInputStream("C:\\B-large.in");
			  DataInputStream in = new DataInputStream(fstream);
			  BufferedReader br = new BufferedReader(new InputStreamReader(in));
			  String strLine;
			  int nbr=1;
			  strLine = br.readLine();
			  int T=Integer.parseInt(strLine);
			  System.out.println (T);
            int tab[];
            int N;
            int S;
            int p;
            int result;
            int k=0;
			  for(int i=0;i<T;i++){
		      strLine = br.readLine();
			//  System.out.println (strLine);
		      tab=detail(strLine);
		      N=tab[0];
		      S=tab[1];
		      p=tab[2];
		      result=0;
		      for(int j=0;j<N;j++){
	    			  System.out.println("val->: "+tab[3+j]);
                      
	    			  if(tab[3+j]>=p){
		    		  if(tab[3+j]/3>=p) result++;
		    		  else if ((tab[3+j]-p)/2>=p-1) result++;
		    		  else if(((tab[3+j]-p)/2>=p-2) && S>0) {
		    			  result++;
		    			  S--;
		    		  }
	    			  }		    		  
			 
		      }
				  writeToFile("Case #"+nbr+": "+result);
				  System.out.println ("Case #"+nbr+": "+result);

			 
			  nbr++;
			  }
			  in.close();
			    }
		 catch (Exception e){
			  System.err.println("Error: " + e.getMessage());
			  }

		
	}

}
