package problem1;

import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.IOException;
import java.io.PrintStream;
import java.util.Arrays;





public class Problem1 {

    public static void main(String[] args) throws FileNotFoundException, IOException{
        try {
             TextIO.readFile("L:\\Coodejam\\Input\\Input.txt");
        }
        catch (IllegalArgumentException e) {
              System.out.println("Can't open file ");
              System.exit(0);
         }
        
        FileOutputStream fout = new FileOutputStream("L:\\Coodejam\\Output\\output.txt");
        PrintStream ps=new PrintStream(fout);
        
        int cases=TextIO.getInt();
        int googlers=0,surprising=0,least=0;
        for(int i=0;i<cases;i++){
            int counter=0;
            googlers=TextIO.getInt();
            surprising=TextIO.getInt();
            least=TextIO.getInt();
            int score[]=new int[googlers];
            for(int j=0;j<googlers;j++){
                score[j]=TextIO.getInt();
                 }
            
            
            
            
            Arrays.sort(score);
            int temp=0;
            int sup[]=new int[surprising];
            
          for(int j=0;j<googlers && surprising>0;j++){
               if(biggestNS(score[j])<least && biggestS(score[j])==least){
                   surprising--;
                   counter++;
                }
               }
           
            for(int j=0;j<googlers;j++){
                if(surprising==0)temp=biggestNS(score[j]);
                    
                else {
                    temp=biggestS(score[j]);
                    surprising--;     
                } 
                   if(temp>=least)counter++;
           
             }
            
             ps.println("Case #"+(i+1)+": "+counter);
        }
    }
    
   static int biggestNS(int x){
       if(x==0)return 0;
       if(x==1)return 1;
       return ((x-1)/3)+1;
   }
   
   static int biggestS(int x){
       if(x==0)return 0;
       if(x==1)return 1;
       return ((x-2)/3)+2;
   }
}
package QR_2012;

import java.io.FileInputStream;
import java.io.IOException;
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;

import Utils.IOStreams;

public class B_Dancing_With_The_Googlers {
	
	public static void main(String[] args) throws IOException {
		
		IOStreams streams = new IOStreams(args[0]);
		System.setIn(new FileInputStream(args[0]));
		Scanner sc = new Scanner(System.in);
		
		sc.nextLine(); // Skip number of cases
		int caseNumber = 1;
		while (sc.hasNextInt()) {
			
			int numberOfGooglers = sc.nextInt();
			int surprisingTriplets = sc.nextInt();
			int minimumScore = sc.nextInt();
			List<Integer> totalPoints = new ArrayList<Integer>();
			for(int i=0 ; i<numberOfGooglers ; i++){
				totalPoints.add(sc.nextInt());
			}
			
			streams.printLine("Case #" + (caseNumber++) + ": " + solveIt(numberOfGooglers, surprisingTriplets, minimumScore, totalPoints) + "\n");
		}
		
		streams.closeStreams();
					
	}

	private static int solveIt(int numberOfGooglers, int surprisingTriplets, int minimumScore, List<Integer> totalPoints) {
		
		int solution = 0;
		
		for (Integer integer : totalPoints) {
			
			if(integer==0){
				if(minimumScore==0) solution++;
				continue;
			}
			
			if(integer%3!=0){
				if((integer/3+1)>=minimumScore)
					solution++;
				else if(integer/3+1<minimumScore && (integer/3)+(integer%3)>=minimumScore && surprisingTriplets>0){
					solution++;
					surprisingTriplets--;
				}
			}
			else if (integer%3==0){
				if(integer/3>=minimumScore)
					solution++;
				else if(integer/3<minimumScore && integer/3+1>=minimumScore && surprisingTriplets>0){
					solution++;
					surprisingTriplets--;
				}
			}
		}
		
		return solution;
	}

}
