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 quialification;

import base.Base;

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

/**
 * Created with IntelliJ IDEA.
 * User: babulya
 * Date: 14.04.12
 * Time: 19:10
 * To change this template use File | Settings | File Templates.
 */
public class B extends Base {

    private static int maxNoSurprising(int googler) {
        switch (googler % 3) {
            case 0: return googler / 3;
            case 1: return googler / 3 + 1;
            case 2: return googler / 3 + 1;
        }
        throw new RuntimeException("AAA");
    }

    private static int maxSurprising(int googler) {
        switch (googler % 3) {
            case 0: return googler > 0 ? googler / 3 + 1 : 0;
            case 1: return googler / 3 + 1;
            case 2: return googler / 3 + 2;
        }
        throw new RuntimeException("AAA");
    }

    @Override
    protected void solve(Scanner in, PrintStream out) {
        int T = in.nextInt();
        for (int i = 0; i < T; i++) {
            int N = in.nextInt();
            int S = in.nextInt();
            int p = in.nextInt();
            int[] googlers = new int[N];
            for (int j = 0; j < N; j++) {
                googlers[j] = in.nextInt();
            }
            //
            int answer = 0;
            for (int googler : googlers) {
                if (maxNoSurprising(googler) >= p) {
                    answer++;
                } else if (maxSurprising(googler) >= p && S > 0) {
                    answer++;
                    S--;
                }
            }
            //
            out.println(String.format("Case #%d: %d", (i+1), answer));
        }
    }

    public static void main(String[] args) {
        new B();
    }
}
