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.*;
import java.io.*;

public class P2
{
    public static void main(String[] args) throws Exception
    {
        Scanner sc = new Scanner(new FileReader("B-small-attempt0.in"));
        PrintWriter pw = new PrintWriter(new FileWriter("output.txt"));
        
        int cases = Integer.parseInt(sc.nextLine());
        int c = 0, temp = 0, us = 0;
        
        for (int i = 0; i < cases; i++)
        {
            int n = sc.nextInt(); // no. of googlers
            int s = sc.nextInt(); // no. of surprising
            int p = sc.nextInt(); // criterion
            us = 0; // used suprises
            c = 0; // googlers that pass the test
            
            for(int j = 0; j<n; j++)
            {
                temp = sc.nextInt();
                double q = (temp+0.0)/(3.0);
                // total = 4 (1 1 2) 1.33
                int t1 = ((int)Math.floor(q+(2.0/3.0)));
                int t2 = ((int)Math.floor(q+(4.0/3.0)));
                if(temp < p)
                {
                    continue;
                }
                else if(q >= p || t1 >= p)
                {
                    c++;
                    continue;
                }
                // total = 5 (1 1 3) 1.66  
                else if(us != s && t2 >= p)
                {
                    c++;
                    us++;
                    continue;
                }
            }
            
            pw.println("Case #" + (i + 1) + ": " + c);
        }
        
        pw.close();
        sc.close();
    }
}

// ((temp+1)/n)+ 1 >= p
// ((temp+1)/n) >= p
// q+1 >= p