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.*;
import java.io.*;

public class DancingWithGooglers
{
	public static void main(String args[]) throws IOException
	{
		int case_no;
		String result = "";
		File inputFile = new File(".in");
		FileInputStream fin = new FileInputStream(inputFile);
		Scanner in = new Scanner(fin);

		PrintWriter out = new PrintWriter(new FileWriter(".out", true));

		case_no = in.nextInt();

		for( int i = 0; i < case_no; i++ )
		{
			int num_googlers, t_surprise, point, max_number_overp = 0, number_overp_temp = 0;
			PriorityQueue<Integer> _pq = new PriorityQueue<Integer>();
			result += "Case #"+ (i+1) + ": ";
			num_googlers = in.nextInt();
			t_surprise = in.nextInt();
			point = in.nextInt();

			for( int j = 0; j < num_googlers; j++ )
			{
				_pq.add(new Integer(in.nextInt()));
			}



			while( _pq.size()!= 0 )
			{
				int temp = _pq.poll().intValue();

				if( (temp <= 3*(point-1))&&(temp>=(3*(point-1)-1)))
				{
					if( (number_overp_temp < t_surprise)&&(temp > 0) )
					{
						number_overp_temp++;
						max_number_overp++;
					}
				}
				else if (temp > 3*(point-1))
				{
					max_number_overp++;

				}
			}

			result += "" + max_number_overp;
			out.println(result);
			result = "";
		}
		in.close();
		out.close();

	}
}
