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.*;

/**
 * ***************************************************************************
 * Created by IntelliJ IDEA.
 * User: Narender Singh Pal
 * Date: 4/14/12
 * Time: 8:32 AM
 * <p/>
 * ***************************************************************************
 * <p/>
 * Copyright (c) 2012 All Rights Reserved.
 * <p/>
 * <p/>
 * ***************************************************************************
 */
public class DancingWithTheGooglers
{
    public static void main (String args[])
    {
        try
        {
            BufferedReader Br = new BufferedReader(new FileReader("C:\\Input\\B-large.in"));
            BufferedWriter Bw = new BufferedWriter(new FileWriter("C:\\Input\\B-large.out"));
            //read number if test cases
            int $TC = Integer.valueOf(Br.readLine());
            //System.out.println("$TC :"+ $TC);
            int $N, $S, $P;
            int [] $Input;
            for(int tc=1; tc <=$TC; tc++)
            {
                String Pl = Br.readLine();
                String []arr = Pl.split(" ");
                $Input = new int[arr.length];
                for(int j =0; j < arr.length; j++)
                {
                    $Input[j] = Integer.valueOf(arr[j]);
                }
                $N = $Input[0];
                $S = $Input[1];
                $P = $Input[2];
                //System.out.println("$N :" + $N + "\n$S :" + $S + "\n$P :" + $P);

                int $Result=0, $BR_Min=0, $BS_Min=0, $BS_Max=0;
                if($P ==0)
                {
                    $Result = $N;
                }
                else
                {
                    //Calculate minimum sum for Best Result
                    $BR_Min = ($P * 3) - 2;

                    //calculate maximum and minimum sum for Best and Surprising result
                    $BS_Min = $BR_Min - 2;
                    $BS_Max = $BR_Min;

                    //count the maximum number of best results
                    for (int n=3; n < 3+$N ; n++)
                    {
                        int $Num = $Input[n];
                        if($Num >= $BR_Min)
                        {
                            $Result++;
                        }
                        else if($Num <= $BS_Max && $Num >= $BS_Min && $S > 0 && $Num > 0)
                        {
                            $Result++;
                            $S--;
                        }
                    }
                }
                //System.out.println("Case #"+ tc+": "+$Result);
                Bw.write("Case #"+ tc+": "+$Result);
                Bw.write('\n');
            }
            Br.close();
            Bw.close();
        }
        catch (IOException e)
        {
            e.printStackTrace();
        }
    }
}

