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 dancing.with.the.googlers;

/**
 *
 * @author Optee
 */
public class ScoreCounter {

    int numberOfGooglers;
    int surpriseCount;
    int minScore;
    int[] scores;

    public ScoreCounter(String line) {
        String[] numbers = line.split(" ");
        this.numberOfGooglers = Integer.valueOf(numbers[0]);
        this.surpriseCount = Integer.valueOf(numbers[1]);
        this.minScore = Integer.valueOf(numbers[2]);
        this.scores = new int[numbers.length-3];
        int j = 0;
        for (int i = 3; i < numbers.length; i++) {
            scores[j++] = Integer.valueOf(numbers[i]);
        }
    }
    
    int Count2() {
        int winners = 0;
        Integer surprise = surpriseCount;
        
        for (int i = 0; i < numberOfGooglers; i++) {
            int score = this.scores[i];
            int minCount = minScore * 3;
            if(score == 0 && minScore > 0) continue;
            if (score + 2 >= minCount) {
                winners++;
            }
            else if (score + 4 >= minCount && surprise > 0) {
                surprise--;
                winners++;
            }
        }
        return winners;
    }
    
    int Count() throws Exception {
        int winners = 0;
        Integer surprise = surpriseCount;
        Integer possibleSurprises = 0;
        
        for (int i = 0; i < numberOfGooglers; i++) {
            int score = this.scores[i];
            int tail = score - minScore;
            
            if (tail <= 0) continue;
            
            int divTileOne = tail/2;
            int divTileTwo = tail - divTileOne;
            
            if (Math.max(divTileOne, divTileTwo) >= minScore){
                if (Math.max(divTileOne, divTileTwo) - minScore >=2)
                    possibleSurprises++;
                winners++;
            }
            else if (minScore - Math.min(divTileOne, divTileTwo) < 2) {
                winners++;
            }
            else if (minScore - Math.min(divTileOne, divTileTwo) == 2) {
                if (surprise > 0) {
                    surprise--;
                    winners++;
                }
            }
        }            
        return winners;
    }
    
}
