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.FileWriter;
import java.io.IOException;
import java.util.Arrays;

/**
 * Input
 * @author jiptan
 *
 */

public class SolveB {

	public static void main(String[] args) throws IOException {
		
		BufferedReader br = new BufferedReader(new FileReader(args[0]));
		
		int num = Integer.parseInt(br.readLine());
		
		FileWriter fw = new FileWriter(new File("test"));
		
		StringBuilder sb2 = new StringBuilder();
		
		String[] values = null;

		int maxSupNum = 0;
		int minScore = 0;
		
		int lowestScorfeWithSup = 0;
		int lowestScorfeWithOutSup = 0;
		
		
		for (int i=1; i<=num; i++) {
		
			int result = 0;
			
			values = br.readLine().split(" ");

			maxSupNum = Integer.parseInt(values[1]);
			minScore = Integer.parseInt(values[2]);
			
			lowestScorfeWithSup = minScore * 3 - 4;
			lowestScorfeWithOutSup = minScore * 3 - 2;

			lowestScorfeWithOutSup = lowestScorfeWithOutSup < 0 ? 0 : lowestScorfeWithOutSup;
			lowestScorfeWithSup = lowestScorfeWithSup < 0 ? 0 : lowestScorfeWithSup;
			
			
			String[] scoreAry = new String[values.length - 3];
			
			System.arraycopy(values, 3, scoreAry, 0, values.length - 3);

			for (String scoreStr : scoreAry) {
				
				if (Integer.valueOf(scoreStr) >= lowestScorfeWithOutSup) {
					result++;
				} else if (maxSupNum > 0 && Integer.valueOf(scoreStr) >= lowestScorfeWithSup && Integer.valueOf(scoreStr) >= 2) {
					result++;
					maxSupNum = maxSupNum - 1;
				}
			}
			
			String output = String.format("Case #%d: %d", i, result);
			sb2.append(output + "\n");
			System.out.println(output);
		}
		fw.write(sb2.toString());
		fw.close();
	}
}