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.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.io.IOException;
import java.io.PrintWriter;
import java.lang.reflect.Array;

public class MainB {

	final static String FNAME = "B-small-attempt0";

	public BufferedReader in;

	public PrintWriter out;

	void open() throws IOException {
		in = new BufferedReader( new FileReader( new File( FNAME+".in"  ) ) );
		out = new PrintWriter( new File( FNAME + ".out" ) );
	}

	void close() throws IOException {
		out.close();
	}

	private boolean isBetterThanP(int num,int P)
	{
		int diff=num-P;
		int num1=diff/2;
		int num2=diff-num1;
		if(num1+1<P)return false;
		if(num1==num2||(num1+1==num2)) return true;
		return false;
	}
	private boolean isBetterThanPCaseSupersing(int num,int P)
	{
		int diff=num-P;
		if(diff<0) return false;
		int diff1=diff-P+2;
		if(diff1+2>=P) return true;
		return false;
	}
	
	void run() throws IOException {
		
		Integer T=Integer.parseInt(in.readLine()) ;
		for(int i=1;i<=T;i++)
		{
			StringBuffer res=new StringBuffer();
			res.append("Case #" + i + ": ");
			
			String line=in.readLine();
			String nums[]=line.split(" ");
			int N=Integer.parseInt(nums[0]);
			int S=Integer.parseInt(nums[1]);
			int P=Integer.parseInt(nums[2]);
			int c=0;
			int[] arr=new int[N];
			for(int k=0;k<N;k++)
			{
				arr[k]=Integer.parseInt(nums[3+k]);
				if(isBetterThanP(arr[k],P))
				{
					c++;
				}
				else if(S>0&&isBetterThanPCaseSupersing(arr[k],P))
				{
					S--;
					c++;
				}
					
			}
			res.append(c);
			out.println(res.toString());
		}
	}

	public static void main( String[] args ) throws IOException {
		new Thread() {

			public void run() {
				try {
					MainB solution = new MainB();
					solution.open();
					solution.run();
					solution.close();
				} catch ( Exception e ) {
					throw new RuntimeException( e );
				}
			}
		}.start();
	}
}
