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

public class probB
{
	public static void main (String[] args)
	{
		Scanner scan = new Scanner (System.in) ;
		
		int T = scan.nextInt();
		int A[], S,p;
		
		for (int t=0 ; t<T ; t++)
		{
			A = new int[scan.nextInt()];
			S = scan.nextInt();
			p = scan.nextInt();
			//System.out.printf("s:%d p:%d\n",S,p);
			
			for (int i=0 ; i<A.length ; i++)
				A[i]=scan.nextInt();
							
			System.out.printf("Case #%d: %d\n",(t+1),solve(S,p,A));
			//System.out.println("******************************************");
		}
	}
	public static int solve (int S, int p, int[] A)
	{
		Arrays.sort(A);
		int result=0 ;
		int s=0, n;
		
		for (int i=0 ; i<A.length ; i++)
		{
			n = A[i];
			
			//no surprise
			
			if (n==0)
			{
				if (p==0)
					result++;
			}
					
			else if (n/3>=p || (n%3!=0 && n/3+1>=p))
				result++;
			
			else if (s<S && ((n%3==0 && n/3+1==p) || (n%3==2 && n/3+2==p)))
			{
				s++;
				result++;
			}
			//System.out.println(n+" "+s+" "+result);
		}
		return result ;
	}
}
