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.BufferedWriter;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.StringTokenizer;

public class Dancing
{
    
    static int n;
    static int[] score;
    
    static int solve( int surp, int p )
    {
        int notPossible = 0;
        int cutOff = 3*p - 4;
        int surCutOff = 3*p-2;
        

        Arrays.sort( score );

        if( p == 0 )
            return n;

        if( p==1 ) // only score of zero is invalid
        {
            for( int i=0; i<n; i++ )
            {
                if( score[ i ] == 0 )
                    notPossible++;

                else
                    break;
            }
            
            return n-notPossible;
        }

        for( int i=0; i<n; i++ )
        {
            /* if( score[ i ] <= p )
            {
                notPossible++;
                continue;
            } */
            
            if( score[ i ]< cutOff )
            {
                notPossible++;
                continue;
            }

            // check if surprising
            else if(score[i] < surCutOff) // surprising possible
            {
                if( surp > 0 )
                {
                    surp--;
                    continue;
                }

                else
                {
                    notPossible++;
                }
            }

            else if( score[ i ] >= surCutOff )
            {
                break;
            }



            else
                break;

        }

        
        return n-notPossible;
        
    }

    public static void main( String[] args ) throws IOException
    {
        FileWriter fr= new FileWriter("/home/gowri/Desktop/out.txt");
        BufferedWriter out = new BufferedWriter( fr );
        BufferedReader br = new BufferedReader( new InputStreamReader( System.in ));
        int T = Integer.parseInt( br.readLine() );
        String s;
        StringTokenizer tok;

        for( int i=0; i<T; i++ )
        {
            s = br.readLine();
            tok = new StringTokenizer( s );
            
            n = Integer.parseInt( tok.nextToken() );
            score = new int[ n ];

            int surp = Integer.parseInt( tok.nextToken() );
            int p = Integer.parseInt( tok.nextToken() );

            for( int j=0; j<n; j++ )
            {
                score[ j ] = Integer.parseInt( tok.nextToken() );
            }

            String res = String.format( "Case #%d: ", i+1 );
            out.write( res );
            out.write( ( "" + solve( surp, p ) ) );
            out.newLine();
        }

        out.close();
    }

}

