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.*;
public class Main
{
	public static void main(String[] args)throws IOException
	{
		new Main().start();
	}
	public void start()throws IOException
	{
		BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st;
		int test=Integer.parseInt(br.readLine());
		int ind=1;
		
		while(test-->0)
		{
			st=new  StringTokenizer(br.readLine());
			int ans=0;
			int N=Integer.parseInt(st.nextToken());
			int S=Integer.parseInt(st.nextToken());
			int p=Integer.parseInt(st.nextToken());
			int totalScore[]=new int[N];
			for(int i=0;i<N;i++)
			{
				totalScore[i]=Integer.parseInt(st.nextToken());
			}
			if(p==0)
			{
				ans=N;
				System.out.println("Case #"+ind+": "+ans);
				ind++;
				continue;
			}
			if(p==1)
			{
				ans=0;
				for(int i=0;i<N;i++)
					if(totalScore[i]!=0)
						ans++;
				System.out.println("Case #"+ind+": "+ans);
				ind++;
				continue;
			}
			Arrays.sort(totalScore);
			boolean cons[]=new boolean[N];
			int max=3*p-4;
			for(int i=0;i<N && S>0;i++)
			{
				if(totalScore[i]>=max)
				{
					ans++;
					cons[i]=true;
					S--;
				}
			}
			max=3*p-2;
			for(int i=0;i<N;i++)
			{
				if(totalScore[i]>=max && !cons[i])
					ans++;
			}
			System.out.println("Case #"+ind+": "+ans);
			ind++;
		}
	}
}