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

import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.Arrays;

public class Googler
{

    public static void main(String[] args) throws Exception
    {
        BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
        int i =1;
        int n = Integer.parseInt(reader.readLine());
        for(; i<=n; i++)
        {
            String input = reader.readLine();
            System.out.print("Case #" + i + ": ");
            String[] sp = input.split(" ");
            int numData  = Integer.parseInt(sp[0]);
            int s = Integer.parseInt(sp[1]);
            int p = Integer.parseInt(sp[2]);
            
            int[] data = new int[numData];
            for(int j=0; j<numData; j++)
            {
                data[j] = Integer.parseInt(sp[j+3]);
            }
            System.out.println(count(data, s, p));
        }
    }
    
    public static int count(int[] data, int s, int p)
    {
        Arrays.sort(data);
        int count = 0;
        for(int i=data.length-1; i>=0 && s>=0; i--)
        {
            if(data[i] % 3 == 0)
            {
                if(data[i]/3 >= p)
                {
                    count++;
                    continue;
                }
                else if(data[i]/3 + 1 >=p && s>0 && data[i]/3 -1 >=0)
                {
                    count++;
                    s--;
                    continue;
                }
                else
                {
                    break;
                }
            }
            else if(data[i] % 3 == 2)
            {
                if((data[i]/3 >= p) || data[i]/3 + 1 >=p)
                {
                    count++;
                    continue;
                }
                else if(data[i]/3 + 2 >=p && s>0)
                {
                    count++;
                    s--;
                    continue;
                }
                else
                {
                    break;
                }
            }
            else
            {
                if((data[i]/3 >= p) || data[i]/3 + 1 >=p)
                {
                    count++;
                    continue;
                }
                else if(data[i]/3 - 1 >=p && s>0 && data[i]/3 - 1>=0)
                {
                    count++;
                    s--;
                    continue;
                }
                else
                {
                    break;
                }
            }
        }
        
        return count;
    }
    
}
