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.*;

class b
{
	public static void main(String [] args)
	{
	 	Scanner in = new Scanner(System.in);
	 	int T = in.nextInt();
	 	for(int t=1;t<=T;++t)
	 	{
	 		int N = in.nextInt();
	 		int S = in.nextInt();
	 		int p = in.nextInt();
	 		int max = 0;
	 		int trips [] = new int[N];
	 		for(int i=0;i<N;++i)
	 		{
	 			trips[i] = in.nextInt();
	 			int div3 = trips[i] / 3;
	 			int diff = trips[i] - div3*3;
	 			if(diff == 0)
	 			{
	 				if(div3 >= p)
	 				{
	 					max++;
	 				}
	 				else
	 				{
	 					if(S > 0 && div3+1 >= p && div3-1 >= 0)
	 					{
	 						max++;
	 						S--;
	 					}
	 				}
	 			}
	 			else if(diff == 1)
	 			{
	 				//Still need to allocate 1 more
	 				if(div3 >= p)
	 				{
	 					++max;
	 				}
	 				else if(div3+1 >= p)
	 				{
	 					++max;
	 				}
	 			}
	 			else if(diff == 2)
	 			{
	 				//Still need to allocate 2 more
	 				if(div3 >= p)
	 				{
	 					max++;
	 				}
	 				else
	 				{
	 					if(div3+1 >= p)
	 					{
	 						max++;
	 					}
	 					else if(S > 0 && div3+2 >= p)
	 					{
	 						max++;
	 						S--;
	 					}
	 				}
	 			}
	 		}
	 		System.out.println("Case #"+t+": " + max);
	 	}
	}
}
