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.*;
import java.util.StringTokenizer;

public class Dancing {

    public static void main(String[] args) {
        try {
            BufferedReader in = new BufferedReader(new FileReader("B-small-attempt0.in"));
            PrintWriter out = new PrintWriter(new FileWriter("B-small-attempt0.out"));

            Integer cases = Integer.valueOf(in.readLine().trim());
            for (int i = 0; i < cases; i++) {
                StringTokenizer st = new StringTokenizer(in.readLine().trim());
                int dancers = Integer.valueOf(st.nextToken().trim());
                int surprising = Integer.valueOf(st.nextToken().trim());
                int minScore = Integer.valueOf(st.nextToken().trim());
                int[] scoreTotals = new int[dancers];
                for (int j = 0; j < scoreTotals.length; j++) {
                    scoreTotals[j] = Integer.valueOf(st.nextToken().trim());
                }
                int maxDancers = solve(surprising, 0, minScore, scoreTotals, 0);
                out.println(String.format("Case #%d: %d", i+1, maxDancers));
            }

            out.close();
            in.close();
        } catch (IOException e) {
            e.printStackTrace();
        }
    }

    public static int solve(int maxSurprising, int numSurprising, int minScore, int[] scoreTotals, int totalIndex) {
        int maxDancers = 0;
        if (totalIndex < scoreTotals.length) {
            int totalScore = scoreTotals[totalIndex];
            for (int i = (int)Math.ceil(totalScore/3); i <= (int)Math.min(totalScore,Math.ceil((totalScore+4)/3)); i++) {
                for (int j = Math.max(i-2,0); j <= i; j++) {
                    int k = totalScore - i - j;
                    if ((i - k > 2) || (i - k < 0)) continue;
                    boolean isSurprising = Math.abs(i - j) == 2 || Math.abs(i - k) == 2 || Math.abs(j - k) == 2;
                    if (isSurprising && maxSurprising == numSurprising) continue;
                    int dancers = (i >= minScore ? 1 : 0) + solve(maxSurprising, numSurprising + (isSurprising ? 1 : 0), minScore, scoreTotals, totalIndex+1);
                    maxDancers = Math.max(maxDancers, dancers);
                }
            }
        }
        return maxDancers;
    }
}
