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 com.khajochi.codejam;

import java.io.BufferedReader;
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Arrays;

public class DancingWithTheGooglers
{

	/**
	 * @param args
	 */
	public static void main(String[] args)
	{
		try
		{
			RecycledNumbers sp = new RecycledNumbers();

			FileInputStream fstream = new FileInputStream("/Users/msmart/Documents/My Work/Workspace/M/resource/2012round1/1BSmall.in");
			DataInputStream in = new DataInputStream(fstream);
			BufferedReader br = new BufferedReader(new InputStreamReader(in));
			String str = br.readLine();
			int count = 1;
			while ((str = br.readLine()) != null)
			{
//				System.out.println(str);
				
				String[] strSpilt = str.split(" ");
				
				int numInput = Integer.parseInt(strSpilt[0]);
				int numSurprise = Integer.parseInt(strSpilt[1]);
				int sum = Integer.parseInt(strSpilt[2]);
				
				int[] allInput = new int[numInput];
				
				for (int i = 0; i < numInput; i++)
				{
					allInput[i] = Integer.parseInt(strSpilt[i+3]);
//					System.out.println(allInput[i]);
				}
				
				int ans = 0;
				
				Arrays.sort(allInput);
				
				for (int i = 0; i < allInput.length; i++)
				{
					if ( allInput[i] >= sum * 3 )
					{
						ans++;
						continue;
					}
					
					if ( sum * 3 - 2 < 0 )
					{
						continue;
					}
					else if (allInput[i] >= sum * 3 - 2 )
					{
						ans++;
						continue;
					}
					
					if ( sum * 3 - 4 < 0 )
					{
						continue;
					}
					else if (allInput[i] >= sum * 3 - 4 && numSurprise > 0 )
					{
						ans++;
						numSurprise--;
						continue;
					}
					
				}
//				System.out.println(ans);
				
				System.out.println("Case #" + count++ + ": " + ans);
				
			}
			in.close();
		}
		catch (Exception e)
		{
			System.err.println(e);
		}
	
	}

}
