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 qualification.Dancing;

import java.io.*;

public class IO {

    /**
     * Reads a line of text from the input.
     *
     * @return The text entered. @comp Best and worst case are O(U) where U is
     * the complexity of BufferedReader.readLine method for the input.
     */
    public static String readln() {
        InputStreamReader input = new InputStreamReader(System.in);
        BufferedReader keyboard = new BufferedReader(input);

        try {
            return keyboard.readLine();
        } catch (IOException e) {
            println("Unexpected exception while reading input.");
        }
        return null;
    }

    /**
     * Terminates the current line by writing the line separator string. The
     * line separator string is defined by the system property line.separator,
     * and is not necessarily a single newline character ('\n').
     *
     * @pre none @post none @complexity Best and worst case are the same. Time
     * complexity is U where U is the complexity for System.out.println()
     * method.
     */
    public static void println() {
        System.out.println();
    }

    /**
     * Prints a string. If the argument is null then the string "null" is
     * printed. Otherwise, the string's characters are converted into bytes
     * according to the platform's default character encoding, and these bytes
     * are written in exactly the manner of the write(int) method.
     *
     * @param s The string to print. @complexity Best and worst case are the
     * same. Time complexity is U where U is the complexity for
     * System.out.print(String) method. @pre none @post none
     */
    public static void print(String s) {
        System.out.print(s);
    }

    /**
     * Prints a String and then terminate the line. This method behaves as
     * though it invokes print(String) and then println().
     *
     * @param s The string to print. @complexity Best and worst case are the
     * same. Time complexity is U where U is the complexity for
     * System.out.print(String) method. @pre none @post none
     */
    public static void println(String s) {
        print(s);
        println();
    }

    public static int readInt() {
        try {
            int val = Integer.parseInt(readln());

            return val;
        } catch (NumberFormatException ex) {
            println("Not an integer.");
        }

        return -1;
    }
}