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

import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.io.PrintWriter;

public class DancingWithTheGooglers {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		
		PrintWriter out = null;
		BufferedReader in = null;
		String test;
		
		try {
			
			out = new PrintWriter(args[1]);
			in = new BufferedReader(new FileReader(args[0]), 1024);
			
			// number of test cases
			in.readLine();
			
			for (int i=1; (test=in.readLine())!=null; i++) {
				String parameters[] = test.split(" ");
				int googlers = 0;
				int surprising = 0;
				int totalSurprising = Integer.parseInt(parameters[1]);
				int minScore = Integer.parseInt(parameters[2]);
				int minTotal = minScore * 3;
				for (int j=3; j<parameters.length; j++) {
					int score = Integer.parseInt(parameters[j]);
					if (minTotal==0) {
						googlers++;
					}
					else if (score==0) {
						// do nothing
					}
					else if (score>=minTotal-2) {
						googlers++;
					}
					else if (score>=minTotal-4&&surprising<totalSurprising) {
						googlers++;
						surprising++;
					}
				}
				out.printf("Case #%d: %d%n", i, googlers);
			}
			
		} catch (FileNotFoundException e) {
			e.printStackTrace();
		} catch (IOException e) {
			e.printStackTrace();
		}
		
		try {
			if (in!=null)
				in.close();
		} catch (IOException e) {
			e.printStackTrace();
		}
		
		if (out!=null)
			out.close();
		
		
	}

}
