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 knucle.y2012.B;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;

public class B {

	public static void main(String[] args) throws Exception {
		FileReader fr = new FileReader("b-small.in");
		BufferedReader br = new BufferedReader(fr);
		
		BufferedWriter bw = new BufferedWriter(new FileWriter("output.txt"));

		int currentCase = 1;
		int caseNum = Integer.parseInt(br.readLine());
		
		for(currentCase=1; currentCase<=caseNum; currentCase++){
			String line = br.readLine();
			
			String[] inputs = line.split(" ");
			
			int itemNum = Integer.parseInt(inputs[0]);
			int end = itemNum + 3;
			int suprisingNum = Integer.parseInt(inputs[1]);
			int minScore = Integer.parseInt(inputs[2]);
			
			int minTotalScore = Math.max(minScore*3 - 2, minScore);
			int minSuprisingTotalScore = Math.max(minScore*3 - 4, minScore);
			
			int qualifiedNum = 0;
			for(int i=3; i<end; i++){
				double totalScore = Double.parseDouble(inputs[i]);
				if(totalScore >= minTotalScore){
					qualifiedNum++;
				} else if(suprisingNum > 0 && totalScore >= minSuprisingTotalScore){
					qualifiedNum++;
					suprisingNum--;
				}
			}
			

			bw.write("Case #");
			bw.write(Integer.toString(currentCase));
			bw.write(": ");
			
			bw.write(Integer.toString(qualifiedNum));
			
			bw.write('\n');
		}
		
		br.close();
		bw.close();
	}

}
