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 dancers {
	public static int test(int[] n){
		int counter = 0;
		int counter2 = 0;
		for(int i = 3; i < n[0] + 3; i++){
			if(n[i] >= (n[2]*3 - 2)){
				counter++;
			} else if((n[i] < n[2]*3 - 2) && (n[i] >= n[2]*3 - 4)){
				if((n[2]*3-4 < 0) && n[i] == 0){
					continue;
				}
				counter2++;
			}
		}
		
		if(counter2 <= n[1]){
			counter += counter2;
		} else{
			counter += + n[1];
		}
		
		return counter;
	}
	public static void main(String[] args) throws IOException{
		Scanner reader = new Scanner(new File("dancers.in"));
		PrintWriter out = new PrintWriter(new File("dancers.out"));
		
		int n = reader.nextInt();
		int[][] set = new int[n][103];
		for(int i = 0; i < n; i++){
			set[i][0] = reader.nextInt();
			for(int j = 1; j < set[i][0] + 3; j++){
				set[i][j] = reader.nextInt();
			}
		}
		int[] res = new int[n];
		for(int i = 0; i < n; i++){
			res[i] = test(set[i]);
			out.println("Case #" + (i+1) + ": " + res[i]);
		}
		
		out.close();
		System.exit(0);
	}
}