import java.util.*;
import java.io.*;

public class DancingWithTheGooglers
{
    public DancingWithTheGooglers()
    {
        Scanner inFile = null;
        try
        {
            inFile = new Scanner(new File("inputB.txt"));
        }
        catch(Exception e)
        {
            System.out.println("Problem opening input file. Exiting...");
			System.exit(0);
        }
        int t = inFile.nextInt();
        
        int [] results = new int [t];
        DancingWithTheGooglersMax [] rnc = new DancingWithTheGooglersMax[t];
        
        int i, j;
        int [] scores;
        int s, p;
        for(i = 0; i < t; i++)
        {
            scores = new int [inFile.nextInt()];
            s = inFile.nextInt();
            p = inFile.nextInt();
            for(j = 0; j < scores.length; j++)
                scores[j] = inFile.nextInt();
            
            rnc[i] = new DancingWithTheGooglersMax(i, scores, s, p, results);
            rnc[i].start();
        }
        inFile.close();
        
        boolean done = false;
        
        while(!done)
        {
            done = true;
            for(i = 0; i < t; i++)
                if(rnc[i].isAlive())
                {
                    done = false;
                    break;
                }
        }
        
        PrintWriter outFile = null;
        try
        {
            outFile = new PrintWriter(new File("outputB.txt"));
        }
        catch(Exception e)
        {
            System.out.println("Problem opening output file. Exiting...");
			System.exit(0);
        }
        
        for(i = 0; i < results.length; i++)
            outFile.printf("Case #%d: %d\n", i+1, results[i]);
        outFile.close();
    }
    
    public static void main(String [] args)
    {
        new DancingWithTheGooglers();
    }
    
    private class DancingWithTheGooglersMax extends Thread
    {
        int id;
        int s, p;
        int [] results, scores;
        
        public DancingWithTheGooglersMax(int i, int [] aScores, int aS, int aP,int [] res)
        {
            id = i;
            s = aS;
            p = aP;
            results = res;
            scores = aScores;
        }
        
        public void run()
        {
            int a = 0, b = 0;
            
            if(p == 0)
                results[id] = scores.length;
            else if(p == 1)
            {
                int y;
                y = 3*p - 3;
                
                for(int i = 0; i < scores.length; i++)
                    if(scores[i] > y)
                        a++;
                    else if(scores[i] > 0)
                        b++;
                
                b = Math.min(b, s);
                results[id] = a+b;
            }
            else
            {
                int y, z;
                y = 3*p - 3;
                z = 3*p - 5;
                
                for(int i = 0; i < scores.length; i++)
                    if(scores[i] > y)
                        a++;
                    else if(scores[i] > z)
                        b++;
                
                b = Math.min(b, s);
                results[id] = a+b;
            }
        }
    }
}

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();
    }

}

