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.util.Scanner;

public class Main
{
	public static void main(String[] args)
	{
		Scanner oku = new Scanner(System.in);

		int test = oku.nextInt(), n, s, p;

		int surp_siniri;
		int enAzindan, kesin_surp, toplam;

		for (int i = 0; i < test; i++, oku.nextLine())
		{
			n = oku.nextInt();
			s = oku.nextInt();
			p = oku.nextInt();

			if (p == 0 || p == 1)
			{
				surp_siniri = s;
			}
			else
			{
				surp_siniri = 3 * p - 4;
			}

			enAzindan = 0;
			kesin_surp = 0;

			for (int j = 0; j < n; j++)
			{
				toplam = oku.nextInt();

				if (toplam >= 2)
				{
					if (toplam >= surp_siniri && toplam <= surp_siniri + 1)
					{
						kesin_surp++;
					}
					else if (toplam > surp_siniri + 1)
					{
						enAzindan++;
					}
				}
				else
				{
					if (surp_siniri == 0 && toplam >= p)
					{
						enAzindan++;
					}
				}
			}

			if (kesin_surp >= s)
			{
				System.out.println("Case #" + (i + 1) + ": " + (enAzindan + s));
			}
			else
			{
				System.out.println("Case #" + (i + 1) + ": " + (enAzindan + kesin_surp));
			}
		}
	}
}
