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 dg.gcj.bdancing;

import java.util.*;

/**
 * Created by IntelliJ IDEA.
 * User: Dmitry
 * Date: 14.04.12
 * Time: 23:50
 * To change this template use File | Settings | File Templates.
 */
public class PossibleCombinations {

    private final Map<Integer,List<Triplet>> totalScoreToTriplets = new HashMap<Integer,List<Triplet>>();

    public PossibleCombinations() {
        int[] sorted = new int[3];
        for(int i = 0; i <= 10; i ++)
        {
            for(int j = 0; j <= 10; j ++)
            {
                for(int k = 0; k <= 10; k ++)
                {
                    sorted[0] = i;
                    sorted[1] = j;
                    sorted[2] = k;

                    Arrays.sort(sorted);

                    if (isPossibleTriplet(sorted))
                    {
                        this.addTriplet(new Triplet(sorted));
                    }
                }
            }
        }
    }

    private boolean isPossibleTriplet(int[] sorted) {
        return sorted[2] - sorted[0] <= 2;
    }

    private void addTriplet(Triplet triplet) {
        final int totalScore = triplet.getTotal();
        List<Triplet> triplets = this.totalScoreToTriplets.get(totalScore);
        if (triplets == null)
        {
            triplets = new ArrayList<Triplet>();
            this.totalScoreToTriplets.put(totalScore, triplets);
        }

        if (!triplets.contains(triplet))
        {
            triplets.add(triplet);
        }
    }

    public List<Triplet> findTripletsByTotalScore(int totalScore)
    {
        final List<Triplet> triplets = this.totalScoreToTriplets.get(totalScore);
        if (triplets == null)
        {
            throw new IllegalArgumentException("Impossible total score " + totalScore);
        }
        return triplets;
    }

}
