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 codejam.surprisingGooglers;

import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.List;

public class Solver {

	public int getMaximumNumberOfPHavers(int numberOfSurprises, int bestResult, Integer... totals){
		List<PossibleSurpriseCase> allCases = buildCases(numberOfSurprises, Arrays.asList(totals));
		int maxPHavers = 0;
		for (PossibleSurpriseCase surpriseCase : allCases) {
			maxPHavers = Math.max(surpriseCase.getMaximumPHavers(bestResult), maxPHavers);
		}
		return maxPHavers;
	}

	private List<PossibleSurpriseCase> buildCases(int numberOfSurprises, List<Integer> totals) {
		if (totals.isEmpty()) return Collections.singletonList(PossibleSurpriseCase.trivial());
		List<PossibleSurpriseCase> surprise = combine(true, totals.get(0), buildCases(numberOfSurprises-1, totals.subList(1, totals.size())));
		if (numberOfSurprises == totals.size()) return surprise;
		List<PossibleSurpriseCase> noSurprise = combine(false, totals.get(0), buildCases(numberOfSurprises, totals.subList(1, totals.size())));
		if (numberOfSurprises <= 0) return noSurprise;
		return append(surprise,	noSurprise);
	}
	
	private List<PossibleSurpriseCase> append(
			List<PossibleSurpriseCase> one,
			List<PossibleSurpriseCase> two) {
		List<PossibleSurpriseCase> r = new ArrayList<PossibleSurpriseCase>(one.size() + two.size());
		r.addAll(one);
		r.addAll(two);
		return r;
	}

	public static List<PossibleSurpriseCase> combine(boolean isSurprise, int score, List<PossibleSurpriseCase> cases) {
		List<PossibleSurpriseCase> r = new ArrayList<PossibleSurpriseCase>(cases.size());
		for (PossibleSurpriseCase surpriseCase : cases) {
			r.add(PossibleSurpriseCase.combine(isSurprise, score, surpriseCase));
		}
		return r;
	}

	
}
