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 codejam.qual_2012;

import java.io.File;
import java.io.PrintStream;
import java.util.Scanner;

public class MainB {

    public static void main(String[] args) throws Exception {

        String f = "/home/floris/dev/java/Test/src/codejam/qual_2012/B-small-attempt0.in";
        Scanner sc = new Scanner(new File(f));
        System.setOut(new PrintStream(new File(f+".out")));
        int T = sc.nextInt();
        for (int i=1; T-- > 0; i++) {
            int numberOfGooglers = sc.nextInt();
            int numberOfSurprises = sc.nextInt();
            int p = sc.nextInt();
            int[] values = new int[numberOfGooglers];
            for (int j = 0; j < numberOfGooglers; j++) {
                values[j] = sc.nextInt();
            }
            
            System.out.printf("Case #%d: %d%n", i, solve(numberOfGooglers, numberOfSurprises, p, values));
        }
    }

    private static int solve(int numberOfGooglers, int numberOfSurprises, int p, int[] values) {
        int result = 0;
        for (int v : values) {
            int d = v % 3;
            if (v == 0) {
                if (p==0) result++;
            } else if (v == 1) {
                if (p<=1) result++;
            } else if (d == 0) {
                if (v/3 >= p) result++;
                else if (numberOfSurprises>0 && (v/3+1)>=p) {result++; numberOfSurprises--;}
            } else if (d==1) {
                if (v/3+1 >= p) result++;
            } else if (d==2) {
                if (v/3+1 >= p) result++;
                else if (numberOfSurprises>0 && (v/3+2)>=p) {result++; numberOfSurprises--;}
            }
        }
        return result;
    }
}
