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 DWtG {

	static int T,N,S,P;
	static int[] t = new int[1000];
	
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int T = Integer.parseInt(sc.nextLine());
		for (int k = 0; k<T; k++)
		{
			int result = 0;
			N = sc.nextInt();
			S = sc.nextInt();
			P = sc.nextInt();
			for (int i =0; i<N; i++)
			{
				t[i] = sc.nextInt();
				int base =(int) t[i]/3;
				switch (t[i]%3)
				{
				case 0:
				{
					if (base >= P) result++;
					else
					{
						if (S > 0 && base > 0 && base+1>=P)
						{
							result++;
							S--;
						}
					}
					break;
				}
				case 1:
				{
					if (base >= P || base+1 >= P) result++;
					else
					{
						if (S > 0 && base+1 >=P) 
						{
							result ++;
							S--;
						}
					}
					break;
				}
				case 2:
				{
					if (base + 1 >= P || base >= P) result ++;
			          else
			          {
			            if (S > 0 && base + 2 >= P)
			            {
			              result++;
			              S--;
			            }
			          }

					break;
				}
				}
			}
			System.out.println("Case #" + (k+1) + ": " + result);
		}
	}

}
