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;
   }
}
/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package google2012;

import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.util.logging.Level;
import java.util.logging.Logger;

/**
 *
 * @author g
 */
public class Google2012 {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
        try {
            BufferedReader reader = new BufferedReader(new FileReader(args[0]));
            String line;
            int numCases = Integer.parseInt(reader.readLine());
            for (int i=0; i<numCases; i++) {
                line = reader.readLine();
                String[] tokens = line.split(" ");
                int dancers = Integer.parseInt(tokens[0]);
                int special = Integer.parseInt(tokens[1]);
                int maxScore = Integer.parseInt(tokens[2]);
                int minSumWithoutSpecial = maxScore+Math.max((maxScore-1),0)+Math.max(maxScore-1,0);
                int minSumWithSpecials = maxScore+Math.max(maxScore-2,0)+Math.max(maxScore-2,0);
                int counter=0;
                for (int j=0; j<dancers; j++) {
                    int sum = Integer.parseInt(tokens[3+j]);
                    if (sum >= minSumWithoutSpecial) {
                        counter++;
                        continue;
                    }
                    if (sum >= minSumWithSpecials && special > 0) {
                        counter++;
                        special--;
                        continue;                       
                    }
                }
                System.out.println("Case #" + (i+1) + ": " + counter);
            }
        } catch (IOException ex) {
            Logger.getLogger(Google2012.class.getName()).log(Level.SEVERE, null, ex);
        }
        
    }
}
