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

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

public class B {

	public static void main(String[] args) throws Exception {
		new B().run();
	}

	void run() throws Exception {
		Scanner in = new Scanner(System.in);
		in = new Scanner(new FileInputStream("B-small-attempt0.in"));
		PrintStream out = System.out;
		out = new PrintStream("B-small-attempt0.out");

		int T = in.nextInt();
		for (int x = 1; x <= T; x++) {
			int N = in.nextInt();
			int S = in.nextInt();
			int p = in.nextInt();
			int t[] = new int[N];
			for (int i = 0; i < t.length; i++)
				t[i] = in.nextInt();
			out.printf("Case #%d: %d\n", x, countAtLeastP(t, p, S));
		}

	}

	int countAtLeastP(int[] t, int p, int s) {
		int canN = 0;
		int canS = 0;
		for (int i : t)
			if (canAtLeastPNonSurprising(i, p)) canN++;
			else if (canAtLeastPSurprising(i, p)) canS++;
		return (canN ) + Math.min(canS, s);
	}

	// min total score with best ind score of p is p + (p-1) + (p-1)
	boolean canAtLeastPNonSurprising(int s, int p) {
		return s >= 3 * p - 2;
	}

	// min surp total score with best ind score of p is p + (p-2) + (p-2)
	boolean canAtLeastPSurprising(int s, int p) {
		if (s < 2) return false;
		return s >= 3 * p - 4;
	}

}
