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.*;

/**
 * @author OleGG
 */
public class QualTaskB {
    public static void main(String[] args) throws Throwable {
        //StreamTokenizer st = new StreamTokenizer(new BufferedReader(new FileReader("B-small-attempt0.in.txt")));
        PrintWriter pw = new PrintWriter(new FileWriter("B-small-attempt0.out.txt"));
        StreamTokenizer st = new StreamTokenizer(new InputStreamReader(System.in));
        st.nextToken();
        int t = (int)st.nval;

        for (int test = 1; test <= t; ++test) {
            st.nextToken();
            int n = (int)st.nval;
            st.nextToken();
            int s = (int)st.nval;
            st.nextToken();
            int p = (int)st.nval;

            int[] val = new int[n];
            for (int i = 0; i < n; ++i) {
                st.nextToken();
                val[i] = (int)st.nval;
            }

            int[][] dyn = new int[n + 1][s + 1];
            for (int i = 0; i <= n; ++i) {
                Arrays.fill(dyn[i], 0);
            }

            for (int i = 0; i < n; ++i) {
                dyn[i + 1][0] = dyn[i][0];
                if ((val[i] + 2) / 3 >= p) {
                     ++dyn[i + 1][0];
                }

                for (int j = 0; j < s; ++j) {
                    int add = (val[i] + 2) / 3 >= p ? 1 : 0;
                    int addS = Integer.MIN_VALUE;
                    if (val[i] >= 2 && val[i] <= 28) {
                        switch (val[i] % 3) {
                            case 0:
                            case 1:
                                addS = val[i] / 3 + 1 >= p ? 1 : 0;
                                break;
                            case 2:
                                addS = val[i] / 3 + 2 >= p ? 1 : 0;
                                break;
                        }
                    }
                    dyn[i + 1][j + 1] = Math.max(dyn[i][j+1] + add, dyn[i][j] + addS);
                }
            }
            pw.printf("Case #%d: %d\n", test, dyn[n][s]);
        }
        pw.close();
    }
}
