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;

import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.HashMap;
import java.util.Scanner;

class ProbB{
	public static void main(String[] args) throws FileNotFoundException{
                
                File in;
                File out;
                Scanner sc;
                PrintWriter pw;
                int T;
		
                in = new File("B2.in");
                out = new File("B.out");
                
                sc = new Scanner(in);
                pw = new PrintWriter(out); 
                
                T = sc.nextInt();
                sc.nextLine();
                
                for(int j = 1; j<=T; j++){
                    int N = sc.nextInt();
                    int S = sc.nextInt();
                    int S2 = S;
                    int p = sc.nextInt();
                    int ans = 0;
                    for(int u = 1; u<=N; u++){
                        int a = sc.nextInt();
                        int e = isEligible(a, p);
                        switch(e){
                            case 2:
                                ans++;
                                break;
                            case 1:
                                S--;
                                ans++;
                                break;
                        }
                       
                    }
                    if(S<0){
                            ans = ans + S;
                        }
                    pw.println("Case #" + j + ": " + ans);
                }
		pw.close();
                
	}
        static int isEligible(int a, int p){
            int lo = a/3;
            int me = (a - lo)/2;
            int hi = a - lo - me;
            
            if(hi>=p){
                return 2;
            }
            if(hi==me && hi+1>=p && me != 0){
                return 1;
            }
            else{
                return 0;
            }
        }
	
}