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;
   }
}
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;


public class Main {

    
    public static void main(String[] args) throws IOException {

        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
        int tc=Integer.parseInt(br.readLine());
        for(int j=0;j<tc;j++)
        {
            String str=br.readLine();
            StringTokenizer st=new StringTokenizer(str);
            int n=Integer.parseInt(st.nextToken());
            int s=Integer.parseInt(st.nextToken());
            int p=Integer.parseInt(st.nextToken());
            int GS[]=new int[n];
            int GT[]=new int[n];
            int cnt=0;
            for(int i=0;i<n;i++)
            {
                GS[i]=Integer.parseInt(st.nextToken());
                GT[i]=GS[i]/3;

            }

            for(int i=0;i<n;i++)
            {
                if (GS[i]==0&&p!=0)
                    continue;
                
                if(GS[i]-(GT[i]*3)==2)
                {
                    
                    GT[i]=GT[i]+1;
                    if(GT[i]>=p)
                    {
                        cnt++;
                        continue;
                    }
                    if(s>0)
                    {
                        if((GT[i]+1)==p)
                        {
                            GT[i]=GT[i]+1;
                            cnt++;
                            s--;
                            
                        }
                    }




                }


            }

            for(int i=0;i<n;i++)
            {
                if (GS[i]==0&&p!=0)
                    continue;
                if(GS[i]-(GT[i]*3)==1)
                {
                    GT[i]=GT[i]+1;
                    if(GT[i]>=p)
                    cnt++;


                }


            }

            for(int i=0;i<n;i++)
            {
                if (GS[i]==0&&p!=0)
                    continue;
                if(GS[i]-(GT[i]*3)==0)
                {
                    if(GT[i]>=p)
                    {
                        cnt++;
                        continue;
                    }
                    else if(s>0)
                    {
                    GT[i] = GT[i] + 1;
                    if(GT[i]>=p)
                        {
                        s--;
                        cnt++;
                        }

                    }

                }


            }

       int x=j+1;
       System.out.println("Case #"+x+": "+cnt);

        }
    }
    

}

