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 tochi.gcj2012;

import java.io.File;
import java.io.PrintStream;
import java.util.Scanner;

import javax.swing.text.html.MinimalHTMLWriter;

public class B {
	/**
	 * @param args
	 * @throws Exception
	 */
	public static void main(String[] args) throws Exception {
		System.setOut(new PrintStream(new File("output.txt")));
		Scanner sc = new Scanner(new File("input.txt"));
		int T = Integer.parseInt(sc.nextLine());
		for (int i = 1; i <= T; i++) {
			String[] strs = sc.nextLine().split(" ");
			int N = Integer.parseInt(strs[0]);
			int S = Integer.parseInt(strs[1]);
			int p = Integer.parseInt(strs[2]);
			int[] t = new int[N];
			for (int j = 0; j < N; j++) {
				t[j] = Integer.parseInt(strs[3 + j]);
			}
			System.out.println("Case #" + i + ": " + answer(N, S, p, t));
		}
	}

	private static int answer(int N, int S, int p, int[] t) {
		int count = 0;
		int count2 = 0;
		for (int i : t) {
			if (i >= (3 * p - 2))
				count++;
			else if ((i >= (3 * p - 4)) && p >= 2)
				count2++;
		}
		int min = S < count2 ? S : count2;
		return count + min;
	}

}
