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

public class Dancing {

	/**
	 * 
	 * @param N
	 *            Number of Googlers
	 * @param S
	 *            number of surprising triplets of scores
	 * @param P
	 * 
	 * @param Ti
	 *            the total points of the Googlers
	 * 
	 * @return what is the maximum number of Googlers that could have had a best
	 *         result of at least p
	 */
	public static int howMany(int N, int S, int P, int[] Ti) {

		if (0 == P)
			return N;

		int count = 0;
		int specials = 0;

		for (int t : Ti) {

			if (0 == t)
				continue;
			
			int mod = t % 3;
			int div = t / 3;

			int max = -1;
			int maxSpecial = -1;

			switch (mod) {

			case 0:
				max = div;
				maxSpecial = div + 1;
				break;

			case 1:
				max = div + 1; // same as 'maxSpecial'
				break;

			case 2:
				max = div + 1;
				maxSpecial = div + 2;
				break;
			}

			if (max >= P)
				count++;

			else if (maxSpecial >= P)
				specials++;
		}

		if (specials > S)
			count += S;

		else
			count += specials;

		return count;
	}
}
