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.BufferedWriter;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;


public class DancingWithTheGooglers {

	/**
	 * @param args
	 * @throws IOException 
	 */
	public static void main(String[] args) throws IOException {
		// TODO Auto-generated method stub

		BufferedReader reader = new BufferedReader(new FileReader(new File("B-small-attempt0.in")));
		BufferedWriter writer = new BufferedWriter(new FileWriter(new File("out")));
		
		int T = Integer.parseInt(reader.readLine());
		
		for(int i = 0;i<T;i++){
			String line = reader.readLine();
			String[] splits = line.split(" ");
			int N = Integer.parseInt(splits[0]);
			int S = Integer.parseInt(splits[1]);
			int p = Integer.parseInt(splits[2]);
			
			int not_sp  = 3*p - 2;
			int sp_up   = 3*p - 3;
			int sp_down = 3*p - 4;
			int result  = 0;
			
 			for(int j = 3;j<splits.length;j++){
				int num = Integer.parseInt(splits[j]);
				if(num >= not_sp){
					result ++;
				}
				else if(num >= sp_down&&num<=sp_up&&num>=p){
					if(S>0){
						result ++;
						S--;
					}		
				}
 			}
 			
 			writer.write("Case #"+(i+1)+": "+result+"\n");
 			writer.flush();
		}
		
		
	}

}
