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.*;
public class dwtg
{
    public void dwtg()throws IOException
    {
        FileInputStream fstream = new FileInputStream("C:/Users/m.l/Desktop/B-small-attempt0.in"); 
        DataInputStream in = new DataInputStream(fstream);
        BufferedReader br = new BufferedReader(new InputStreamReader(in));
        int T=Integer.parseInt(br.readLine());int i,j,k,h,g,l,p=0,N=0,S=0;String input;int temp1,temp2,r,s,n,m,ans=0;
        for(i=0;i<T;i++)
        {
            input=br.readLine()+" ";l=input.length();
            for(j=0;j<l;j++)
            {
                if(input.charAt(j)==' ')
                {N=Integer.parseInt(input.substring(0,j));break;}
            }
            for(k=j+1;k<l;k++)
            {
                if(input.charAt(k)==' ')
                {S=Integer.parseInt(input.substring(j+1,k));break;}
            }
            for(h=k+1;h<l;h++)
            {
                if(input.charAt(h)==' ')
                {p=Integer.parseInt(input.substring(k+1,h));break;}
            }
            int t[]=new int[N];
            temp1=0;temp2=h+1;
            for(g=h+1;g<l;g++)
            {
                if(input.charAt(g)==' ')
                {t[temp1]=Integer.parseInt(input.substring(temp2,g));temp1+=1;temp2=g+1;}
            }
            n=0;m=0;
            for(j=0;j<N;j++)
            {
                r=0;s=0;
                if(t[j]%3==0&&t[j]>=3)
                {r=t[j]/3;s=r+1;}
                if(t[j]%3==1)
                {
                    if(t[j]!=1)
                    {r=(t[j]+2)/3;s=r;}
                    if(t[j]==1)
                    r=(t[j]+2)/3;
                }
                if(t[j]%3==2)
                {r=(t[j]+1)/3;s=r+1;}
                if(r>=p)
                n+=1;
                if(r<p&&s>=p)
                m+=1;
            }
            if(S>=m)
            ans=n+m;
            if(S<m)
            ans=n+S;
            System.out.println("Case #"+(i+1)+": "+ans);
        }
    }
}
        