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 contests.googleJam;

import java.io.*;
import java.util.StringTokenizer;


public class googleDance 
{
   public static void main(String[] args) 
    {
       int noOfDancers;
       int requiredSpecial;
       int bestScore;
       StringTokenizer st;
       char ch;
       BufferedReader br = null;
 
		try {
                        FileWriter fstream = new FileWriter("output.out");
                        BufferedWriter out = new BufferedWriter(fstream);
			String sCurrentLine;
 
			br = new BufferedReader(new FileReader("B-small-attempt1.in"));
                        sCurrentLine = br.readLine();//read the no. of test cases
                        int i = 1;
                        while ((sCurrentLine = br.readLine()) != null) 
                        {     
                            out.write("Case #" + i++ + ": ");
                            st = new StringTokenizer(sCurrentLine," ");
                            noOfDancers = Integer.parseInt(st.nextToken());//no. of dancers
                            requiredSpecial = Integer.parseInt(st.nextToken());//no. of special cases
                            bestScore = Integer.parseInt(st.nextToken());//best score required
                            int ans = 0;
                            int special_Max = 0;
                            for (int j = 0; j < noOfDancers; j++) 
                            {
                                int total = Integer.parseInt(st.nextToken());
                                int last2 = total - bestScore;
                                int second = last2/2;
                                if(total > 28 || (last2/2) >= bestScore || total >= (bestScore + 2*(bestScore-2)) + 2)
                                    ans++;
                                else if(total < 2 )
                                {
                                    if(total >= bestScore)
                                        special_Max++;
                                }
                                else if(total >= (bestScore + 2*(bestScore-2)))
                                {
                                    special_Max++;
                                }
                            }
                            if(special_Max <= requiredSpecial)
                                out.write(ans + special_Max + "\n");
                            else
                                out.write(ans + requiredSpecial + "\n");
                        }
                        out.close();
 
		} catch (IOException e) {
			e.printStackTrace();
		} finally {
			try {
				if (br != null)br.close();
			} catch (IOException ex) {
				ex.printStackTrace();
			}
		} 
    }
}
