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 qualification.b;

import java.util.Scanner;

import common.ISolver;
import common.QuestionHandler;

public class GoggleDancing implements ISolver {

	@Override
	public String solve(String problem) {
		Scanner scan = new Scanner(problem);
		int nGogglers = scan.nextInt();
		int suprising = scan.nextInt();
		int pLeastBest = scan.nextInt();
		int maxWithLeastBest = 0;
		
		int minScoreSum = pLeastBest + 2*(Math.max(pLeastBest-1, 0));
		int minScoreSumWithSurprise = pLeastBest + 2*(Math.max(pLeastBest-2, 0));
		for (int i=0; i<nGogglers; ++i) {
			int sumScore = scan.nextInt();
			if (sumScore >= minScoreSum) {
				++maxWithLeastBest;
			} else if (suprising > 0 && sumScore >= minScoreSumWithSurprise) {
				++maxWithLeastBest;
				--suprising;
			}
		}
		return String.valueOf(maxWithLeastBest);
	}

	@Override
	public void addCase(String problem, String answer) {
		String myAnswer = solve(problem);
		if (!myAnswer.equals(answer)) {
			throw new RuntimeException("Invalid prediction");
		}
		
	}

	public static void main(String[] args) {
		QuestionHandler questionHandler = new QuestionHandler(new GoggleDancing());
		questionHandler.addResource("sample.in", "sample.out");
		
		System.out.println("Sample input:");
		questionHandler.solve("sample.in", "sample.out");
		
		System.out.println("\nSmall input:");
		questionHandler.solve("small.in", "small.out");
	}
}
