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 lt.kasrud.gcj.ex2;

import lt.kasrud.gcj.common.io.Reader;
import lt.kasrud.gcj.common.io.Writer;

import java.io.IOException;
import java.util.*;

public class Main {
  public static void main(String[] args) throws IOException {
    List<String> iData = Reader.readFile("B-small-attempt0.in");
    Writer.writeFile("out2.txt", process(iData.subList(1, iData.size())));
  }

  private static List<String> process(List<String> data) {
    List<String> result = new ArrayList<String>(data.size());
    for(String record : data){
      List<String> tokens = Arrays.asList(record.trim().split(" "));
      result.add(calculate(Integer.valueOf(tokens.get(1)), Integer.valueOf(tokens.get(2)), tokens.subList(3, tokens.size())));
    }

    return result;
  }

  private static String calculate(Integer surpCnt, Integer maxValue, List<String> totPoints) {
    int cnt = 0;
    int minDiff = maxValue > 0 ? 1 : maxValue;
    int maxDiff = maxValue > 1 ? 2 : maxValue;
    int maxTotal = maxValue * 3 - 2 * minDiff;
    int surpTotal = maxValue * 3 - 2 * maxDiff;
    for (String t : totPoints) {
      int total = Integer.valueOf(t);
      if (total >= maxTotal){
        cnt++;
      }else if(total >= surpTotal && surpCnt > 0){
        cnt++;
        surpCnt--;
      }
    }

    return String.valueOf(cnt);
  }
}
