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;
            }
        }
    }
}
/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package codejam2012pa;

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


/**
 *
 * @author Fred
 */
public class CodeJam2012PA 
{

    /**
     *         type entrada.txt | java -jar Programa.jar > saida.txt
     */
    public static void main(String[] args) throws Exception 
    {        

        BufferedReader buf = new BufferedReader(new InputStreamReader(System.in));
        String line = buf.readLine();

        
        int j = 1;
        while((line = buf.readLine()) != null)
        {
            String[] str = line.split(" ");

            int n = Integer.valueOf(str[0]);
            int s = Integer.valueOf(str[1]);
            int p = Integer.valueOf(str[2]);

            ArrayList<Integer> triplets = new ArrayList<Integer>();
            for (int i = 0; i < n; i++) 
            {
                triplets.add(Integer.valueOf(str[3+i]));
            }

            System.out.println("Case #"+j+": "+calcula(s, p, triplets));
            j++;
        }      
    }
    
    public static String calcula(int s, int p, ArrayList<Integer> t)
    {
        int count = 0;
        int sused = 0;
        for(Integer i : t)
        {
            if(i == 0)
            {
                if(p <= 0)
                    count++;
            }
            else if(i == 1)
            {
                if(p <= 1)
                    count++;
            }
            else if(i == 2)
            {
                if(p <= 1)
                    count++;
                else
                {
                    if(p <= 2)
                    {
                        count++;
                        sused++;
                    }
                }
            }
            else if(i == 3)
            {
                if(p <= 1)
                    count++;
                else
                {
                    if(p <= 2)
                    {
                        count++;
                        sused++;
                    }
                }
            }
            else if(i % 3 == 2) //numero 11
            {
                if( (i/3) + 1 >= p)
                    count++;
                else if((i/3) + 2 >= p)
                {
                    sused++;
                    count++;
                }
            }
            else if(i % 3 == 1) // 10
            {
                if((i/3) + 1 >= p)
                    count++;
            }
            else if(i % 3 == 0) //9
            {
                if(i/3 >= p)
                    count++;
                else if((i/3) + 1 >= p)
                {
                    count++;
                    sused++;
                }
            }
        }

        int inv = sused - s;
        if(inv <= 0)
            return String.valueOf(count);
        return String.valueOf(count-inv);
    }

}
