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.math.BigDecimal;
import java.math.RoundingMode;
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;

public class DancingWithGooglers {

    public static void main(String[] args) {
        Scanner problem = new Scanner(System.in);
        int T = problem.nextInt();
        for (int i = 0; i < T; i++) {
            int answer = 0;
            int N = problem.nextInt();
            int S = problem.nextInt();
            int p = problem.nextInt();
            List<Triplet> googlers = new ArrayList<Triplet>();
            for (int j = 0; j < N; j++) {
                googlers.add(new Triplet(problem.nextInt()));
            }
            int possibleSurprises = 0;
            for (Triplet triplet : googlers) {
                if (triplet.minMax() >= p) {
                    answer++;
                    continue;
                }
                if (triplet.maxMax() >= p) {
                    possibleSurprises++;
                }
            }
            answer += possibleSurprises >= S ? S : possibleSurprises;
            System.out.println(String.format("Case #%s: %s", i + 1, answer));
        }
    }

}

class Triplet {

    private int totalScore;

    public Triplet(int totalScore) {
        this.totalScore = totalScore;
    }
    
    private int min() {
        return new BigDecimal(totalScore).divide(new BigDecimal(3), RoundingMode.FLOOR).intValue();
    }

    public int minMax() {
        return new BigDecimal(totalScore).divide(new BigDecimal(3), RoundingMode.CEILING).intValue();
    }

    public int maxMax() {
        int lalala = this.totalScore % 3;
        if (lalala == 0) {
            lalala = 1;
        }
        if (this.totalScore == 0) {
            lalala = 0;
        }
        return this.min() + lalala;
    }
}
