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 codejam2012.qualification;
import java.io.IOException;
import java.io.PrintStream;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.List;
import java.util.Map;
import java.util.Scanner;
import java.util.TreeMap;


public class ProblemB {

    public static void main(String[] args) throws IOException {
        String problem = "ProblemB";
        Scanner in = new Scanner(ClassLoader.getSystemResourceAsStream(String.format("%s.in", problem)));
        PrintStream out = new PrintStream(String.format("C:\\workplace\\GoogleCodeJam\\src\\codejam2012\\qualification\\%s.out", problem));
//        out = System.out;
        
//        4
//        3 1 5 15 13 11
//        3 0 8 23 22 21
//        2 1 1 8 0
//        6 2 8 29 20 8 18 18 21
        int numInputs = in.nextInt();
        in.nextLine();
        for (int i = 0; i < numInputs; i++) {
            int N = in.nextInt();
            int S = in.nextInt();
            int p = in.nextInt();
            int c = 0;
            for (int j = 0; j < N; j++) {
                int n = in.nextInt();
                int t;
                if (n % 3 == 0) {
                    t = n / 3;
                } else {
                    t = n / 3 + 1;
                }
                if (t >= p) {
                    c++;
                    continue;
                }
                if (t + 1 == p && n % 3 != 1 && t != 0 && S > 0) {
                    c++;
                    S--;
                }
            }
            out.println("Case #" + (i+1) + ": " + c);
//            out.println(map);
        }
    }
}
