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.io.File;
import java.io.FileNotFoundException;
import java.util.Formatter;
import java.util.Scanner;

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

/**
 *
 * @author milen.chechev
 */
public class Dancing {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) throws FileNotFoundException {
        Scanner in = new Scanner(new File("input.txt"));
        Formatter out = new Formatter(new File("output.txt"));

        int t = in.nextInt();
        for(int k = 0; k < t ; k++){
            int n = in.nextInt();
            int surprizing = in.nextInt();
            int limit = in.nextInt();
            int accum = 0;
            for(int i = 0 ; i < n ; i ++){
                int sum = in.nextInt();
                if(sum/3 >= limit){
                    accum ++;
                }else if( sum%3 == 0 ){
                    if(sum/3> 0 && sum/3+1 >=limit && surprizing>0){
                        accum ++;
                        surprizing--;
                    }
                }else if ( sum%3==1){
                    if(sum/3+1 >=limit){
                        accum++;
                    }else if(sum/3> 0 && surprizing > 0 && sum/3+2 >=limit){
                        accum++;
                        surprizing--;
                    }
                }else if(sum%3==2){
                    if(sum/3+1 >=limit){
                        accum++;
                    }else if(surprizing >0 && sum/3+2 >=limit){
                        accum++;
                        surprizing--;
                    }
                }
            }
            out.format("Case #%d: %d\n",k+1,accum);
        }
        out.close();
    }

}
