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 com.google.codejam;

import com.google.codejam.util.CodeJamInputFile;
import com.google.codejam.util.CodeJamOutputFile;

public class Dancer {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		CodeJamInputFile f = new CodeJamInputFile("in/B-small-attempt0.in");
		
		CodeJamOutputFile fo = new CodeJamOutputFile("out/B-small-attempt0.out");
		
		for(int c = 0; c < f.getCases(); c++){
			int count = 0;
			String line = f.getLine();
			String[] tokens = line.split(" ");
			int goog = Integer.valueOf(tokens[0]);
			int surp = Integer.valueOf(tokens[1]);
			int best = Integer.valueOf(tokens[2]);
			for(int g = 3; g < (goog + 3); g++){
				int tot = Integer.valueOf(tokens[g]);
				System.out.print(tot + " - ");
				if(tot > ((best * 3) - 3)){
					count++;
					continue;
				}
				if((surp > 0) && (tot > ((best * 3) - 5)) && (tot > 2)){
					count++;
					surp--;
				}
			}
			System.out.println(count + "");
			fo.writeCase(c, count + "");
		}
		
		f.close();
		fo.close();
	}

}
