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.File;
import java.io.FileNotFoundException;
import java.util.Scanner;


public class GoogleDance {

    public static void main(String[] args) {
        File inputFile = new File("input.txt");        
        Scanner s;

        try {
            s = new Scanner(inputFile);
            int lineCount = s.nextInt();
            s.nextLine();
            
            int googlers, surprising, target, max;
            int score;
            
            for(int i = 1; i <= lineCount; i++) {
                max = 0;
                googlers = s.nextInt();
                surprising = s.nextInt();
                target = s.nextInt();
                
                for(int j = 0; j < googlers; j++) {
                    score = s.nextInt();
                    
                    if(score == 0 && target == 0) max++;
                    else if(score <= target) continue;
                    else if(score / 3 >= target) max++;
                    else {
                        score -= target;
                        if(score/2 >= target)
                            max++;
                        else if(Math.abs(score/2 - target) < 2)
                            max++;
                        else if(surprising > 0 && Math.abs(score/2 - target) < 3) {
                            max++;
                            surprising--;
                        }
                    }
                }
                
                System.out.println("Case #"+i+": "+max);
            }
            
            s.close();
        } catch (FileNotFoundException e) {
            e.printStackTrace();
        }
    }
}
