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 codejam2.dancing;

import java.util.Scanner;

import codejam2.CodejamCase;
import codejam2.CodejamRunner;

public class Dancing extends CodejamRunner implements CodejamCase {

	private int nGooglers;
	private int surprising;
	private int pointMin;
	private int[] points;
	private String result;
	@Override
	public void compute() {
		int ns = 0;
		int s = 0;
		
		for(int i = 0; i < nGooglers; i++) {
			if(points[i] >= 3*pointMin-2)
				ns++;
			else if(pointMin>1 && points[i] >= 3*pointMin-4)
				s++;
		}
		result = String.valueOf(ns + Math.min(s, surprising));

	}

	@Override
	public String getOutput() {
		return result;
	}

	@Override
	public CodejamCase parseCase(Scanner s) {
		Dancing d = new Dancing();
		d.nGooglers = s.nextInt();
		d.surprising = s.nextInt();
		d.pointMin = s.nextInt();
		d.points = new int[d.nGooglers];
		for(int i = 0; i < d.nGooglers; i++)
			d.points[i] = s.nextInt();
		return d;
	}

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		new Dancing().run(args);
	}

}
