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

import java.util.*;

public class DancingWithGooglers {

	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		
		final int T = in.nextInt();
		for (int testCase = 1; testCase <= T; ++testCase) {

			// initialize parameters
			int N = in.nextInt();
			int S = in.nextInt();
			int p = in.nextInt();
			
			int[] t = new int[N];
			for (int i = 0; i < N; ++i)
				t[i] = in.nextInt();
			Arrays.sort(t);
			
			// make as many people as possible >= p
			int overCount = 0;
			for (int i = N - 1; i >=0; --i) {
				int disagree = minDisagreement(t[i], p);
				if (disagree > 2) {
					break;
				} else if (disagree == 2 && S == 0) {
					break;
				} else if (disagree == 2) {
					--S;
				}
				++overCount;
			}
			assert (S == 0);
			System.out.printf("Case #%d: %d\n", testCase, overCount);
			
		}
	}
	
	private static int minDisagreement(int total, int minHighScore) {
		if (total >= 3 * minHighScore)
			return 0;
		else if (total < minHighScore)
			return Integer.MAX_VALUE; //i.e. impossible
		else
			return minHighScore - (total - minHighScore)/2;
	}
	
}
