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;
   }
}
/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

package google_code_jam;


import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.StringTokenizer;

/**
 *
 * @author lenovo
 */
public class B {


    public static void main(String[] args) throws IOException {
        // TODO code application logic here

        BufferedReader br = new BufferedReader(new FileReader("B-small-attempt0.in"));
        PrintWriter pw = new PrintWriter("B.out" );
        StringTokenizer st=new StringTokenizer(br.readLine());
       // System.out.println(st);
        int x = Integer.parseInt(st.nextToken());
        a1:for (int i = 0; i < x; i++) {
           st = new StringTokenizer(br.readLine());
           int n = Integer.parseInt(st.nextToken());// number of players
           int s = Integer.parseInt(st.nextToken());//number of surprising
           int p = Integer.parseInt(st.nextToken());// best degree required
           int count=0;//
           for (int j = 0; j < n; j++) {
               int temp=Integer.parseInt(st.nextToken());
               int rem=temp%3;
               int div=temp/3;
               if(temp==0 && p!=0)continue;
               else if(temp==0 && p==0){
                   count++;
                   continue;
               }
               if(rem==0){
                   if(div>=p){
                       count++;
                       continue;
                   }
                 else if(div+1>=p && s>0){
                      count++;
                      s--;
                      continue;
                }
               }// end of this condition
               else{
                   if(rem==1){
                    if(div+1 >=p)count++;
                   }
         else if(rem==2){
        if(div+1 >= p)count++;
        else if (div+2  >=p && s>0){
            count++;
            s--;
            continue;
        }
          }
               }
            }// End of converting
           pw.append("Case #"+(i+1)+": "+count+"\n");
      }
        pw.close();
    }

}

