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 assignments;

import java.util.Scanner;

import base.Assignment;

public class AssignmentB implements Assignment {
	int bestResult;
	int numberOfGooglers;
	int numberOfSurprises;
	int[] test;
	@Override
	public String solve() {
		int minNeeded = 3*bestResult - 2;
		int minNeededWithSurprise = 3*bestResult - 4;
		int total = 0;
		for (int i : test) {
			if (i >= minNeeded) {
				total++;
			} else if (i >= minNeededWithSurprise && numberOfSurprises > 0 && bestResult > 1) {
				total++;
				numberOfSurprises--;
			}
			
		}
		return "" + total;
	}

	public static Assignment createFromScanner(Scanner scanner) {
		AssignmentB assignment = new AssignmentB();
		assignment.numberOfGooglers = scanner.nextInt();
		assignment.numberOfSurprises = scanner.nextInt();
		assignment.bestResult = scanner.nextInt();
		assignment.test = new int[assignment.numberOfGooglers];
		for (int i = 0; i < assignment.numberOfGooglers; i++) {
			assignment.test[i] = scanner.nextInt();
		}
		return assignment;
	}
}
