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.*;
import java.util.*;
class Q2
{
    public static void main(String str[])throws IOException
    {
        FileReader fr=new FileReader("B-small-attempt0.in");
//        FileReader fr=new FileReader("B-large.in");
        BufferedReader br=new BufferedReader(fr);
        FileWriter fw=new FileWriter("output.txt");
        BufferedWriter bw=new BufferedWriter(fw);
        PrintWriter pw=new PrintWriter(bw);
        int T=Integer.parseInt(br.readLine());
        for(int i=1;i<=T;i++)
        {
            String s=br.readLine();
            StringTokenizer st=new StringTokenizer(s);
            int N=Integer.parseInt(st.nextToken());
            int S=Integer.parseInt(st.nextToken());
            int p=Integer.parseInt(st.nextToken());
            int Arr[][]=new int[N][4];
            for(int j=0;j<N;j++)
            {
                int num=Integer.parseInt(st.nextToken());
                int mod=num%3;
                Arr[j][0]=mod;
                Arr[j][3]=num;
                int n=num/3;
                if(mod==0)
                {
                    Arr[j][2]=n;
                    if(n>=p)
                        Arr[j][1]=1;
                    else
                        Arr[j][1]=0;
                }
                else
                {
                     Arr[j][2]=n+1;
                     if(n+1>=p)
                        Arr[j][1]=1;
                     else
                        Arr[j][1]=0;
                }
            }
            for(int j=0;j<N;j++)
            {
                if(S==0)
                    break;
                if(Arr[j][1]==0 && (Arr[j][0]==0 || Arr[j][0]==2) && (Arr[j][2]+1)>=p && (Arr[j][2]+1)<=Arr[j][3])
                {
                    S--;
                    Arr[j][1]=1;
                }
            }
            int sum=0;
            for(int j=0;j<N;j++)
            {
                sum+=Arr[j][1];
            }
            pw.println("Case #"+i+": "+sum);
        }
        pw.close();
        bw.close();
        fw.close();
        br.close();
        fr.close();
    }
}
               
                