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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.StringTokenizer;
public class ProblemB {
    public static void main(String[] args) throws IOException {
        BufferedReader leer= new BufferedReader(new InputStreamReader(System.in));
        int T=intS(leer.readLine());
        for (int i = 1; i <= T; i++) {
            StringTokenizer st= new StringTokenizer(leer.readLine());
            int N=intS(st.nextToken());
            int S=intS(st.nextToken());
            int p=intS(st.nextToken());
            int[][] g= new int[N][3];
            for (int j = 0; j < N; j++){
                int v=intS(st.nextToken());
                g[j][0]=v/3;
                g[j][1]=v%3;
                int score[]={g[j][0],g[j][0],g[j][0]};
                if(g[j][1]>=1)
                    score[0]++;
                if(g[j][1]==2)
                    score[1]++;
                if(score[0]>=p)
                    g[j][2]=2;
                else if(score[0]+1>=p && score[0]-score[1]==0 && score[0]!=0 )
                    g[j][2]=1;
                else
                    g[j][2]=0;
            }
            int r=0;
            for (int j = 0; j < N; j++){
                if(g[j][2]==1 && S>0){
                    g[j][2]=2;
                    S--;
                }
                if(g[j][2]==2)
                    r++;
            }
            System.out.println("Case #"+i+": "+r);
        }
    }
    static int intS(String s){
        return Integer.parseInt(s);
    }
}
