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 dancingwiththegooglers;

import java.util.*;
import java.io.*;
/**
 * Google Code Jam 2012
 * Problem B. Dancing With the Googlers
 * @author STEVEN GANTENG
 * step.v4n@gmail.com
 */
public class DancingWithTheGooglers {
    
    public static int cases;
    public static String result="";
    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
        // TODO code application logic here
        try {
            FileInputStream fin = new FileInputStream("B-small-attempt5.in");
            FileOutputStream fout = new FileOutputStream("B-small-attempt5.out");
            Scanner source = new Scanner(fin);
            cases = source.nextInt();
            Double t[] = new Double[100];
            int count=0;
            int a=1;
            for (int j=0;j<cases;j++)
            {
                
                int N = source.nextInt();
                int S = source.nextInt();
                double p = source.nextDouble();//System.out.println(p)
                Double tmp[] = new Double[3];                
                for (int i=0;i<N;i++)
                {
                    t[i]=source.nextDouble();
                    //System.out.print(t[i]+" ");
                    tmp[i] = t[i]/3;                                                                 
                }
                for (int k=0;k<N;k++)
                {                    
                    if (tmp[k]>=p)
                    {
                        count++;
                    }
                    else if (tmp[k]==0)
                    {
                        if (p>0)
                        {
                            
                        }
                    }
                    else if ((tmp[k]-p)>-0.7)
                    {
                        count++;
                    }
                    else if ((tmp[k]-p)>-1.34)
                    {
                        if (S==0)
                        {
                            
                        }
                        else if (S!=0)
                        {
                            count++;
                            S-=1;
                        }
                    }
                        
                    //System.out.print(tmp[k]+" ");
                }
                System.out.println();                
                result += "Case #"+a+": "+count+"\n";    
                a++;
                fout.write(result.getBytes());
                result="";
                count=0;
                System.out.println();                
                
            }
        } catch (IOException e)
        {
            
        }
        //System.out.print(0/3);
    }
}
