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

import java.util.Arrays;
import java.util.Scanner;

public class B {

	public B() {
		Scanner s = new Scanner (System.in);
		
		int t = s.nextInt();
		
		
		for(int i =0; i < t; i++)
		{
			int n = s.nextInt();
			int ss = s.nextInt();
			int p = s.nextInt();
			
			int[] vals = new int[n];
			
			for(int j = 0; j < n; j ++)
				vals[j]=s.nextInt();
			
			Arrays.sort(vals);
			
			int num=0, numLeft = ss;
			for(int j=vals.length-1; j >=0;j--)
			{
				//System.out.println(vals[j]);
				if(numLeft==0 || vals[j]>=29 || vals[j]<2 || (vals[j]+2)/3>=p)
				{
					//System.out.println("here "+(vals[j]+2)/3);
					if((vals[j]+2)/3>=p)
					{
						num++;
					}
				}
				else
				{
					if((vals[j]+4)/3>=p)
					{
						numLeft--;
						num++;
					}
				}
			}
			
			System.out.println("Case #"+(i+1)+": "+num);
		}
	}

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		new B();

	}

}
