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


public class Solution {
	
	public static void main(String[] args)
	{
		Scanner s = new Scanner(System.in);
		int size = s.nextInt();
		for (int count = 1; count <= size; count++){
			int dancerNum = s.nextInt();
			int surpNum = s.nextInt();
			int score = s.nextInt();
			int[] dancerScore = new int[dancerNum];
			char[] marks = new char[dancerNum];
			for (int i = 0; i < dancerNum; i++){
				dancerScore[i] = s.nextInt();
			}
			
			int highB = score * 3 - 2;
			int lowB = (score - 1) * 3 - 1;
			int output = 0;
			int sup  = surpNum;
			int markIdx = 0;
			if (score < 2)
			{
				for (Integer i : dancerScore){
					if (i >= score)
					{
						marks[markIdx] = '+';
						output++;
					}else{
						marks[markIdx] = '-';
					}
					markIdx++;
				}
				
			}
			else
			{
				for (Integer i : dancerScore){
					if (i >= highB){
						output++;
						marks[markIdx] = '+';
					}else if (i< highB && i >= lowB && sup > 0){
						//if (){
						output++;
						sup--;
						marks[markIdx] = '*';
//						}else{
//							
//							marks[markIdx] = '-';
//						}
					}
					else{
						marks[markIdx] = '-';
					}
					markIdx++;
				}
			}
//			System.out.print("Case #"+count+": " + dancerNum + " " + surpNum + " "+ score + "		");
//			for (Integer i: dancerScore)
//			{
//				System.out.print(i+"	");
//			}
			System.out.println("Case #"+count+": "+output);
//			for (Character mark: marks)
//			{
//				System.out.print(mark+"	");
//			}
//			System.out.println();
		}
		
	}

}
