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.util.Arrays;
import java.util.Scanner;

/**
 * @author Dmitry Levshunov (levshunov.d@gmail.com)
 */
public class TaskB {
    private static final int INF = 1000 * 1000 * 1000;

    private static final int[] BEST_NON_SURPRISING = new int[31];
    private static final int[] BEST_SURPRISING = new int[31];

    private static int n;
    private static int p;
    private static int[] scores = new int[100];
    private static int[][] dp = new int[100][101];

    public static void main(String[] args) throws Exception {
        init();

        Scanner scanner = new Scanner(System.in);

        int tests = Integer.parseInt(scanner.nextLine().trim());

        for (int test = 1; test <= tests; test++) {
            n = scanner.nextInt();
            int s = scanner.nextInt();
            p = scanner.nextInt();

            for (int i = 0; i < n; i++) {
                scores[i] = scanner.nextInt();
            }

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

            System.out.printf("Case #%d: %s", test, get(0, s));
            System.out.println();
        }

        scanner.close();
    }

    private static void init() {
        for (int i1 = 0; i1 <= 10; i1++) {
            for (int i2 = i1; i2 <= 10 && i2 - i1 <= 2; i2++) {
                for (int i3 = i2; i3 <= 10 && i3 - i1 <= 2; i3++) {
                    int sum = i1 + i2 + i3;

                    if (i3 - i1 == 2) {
                        BEST_SURPRISING[sum] = Math.max(BEST_SURPRISING[sum], i3);
                    } else {
                        BEST_NON_SURPRISING[sum] = Math.max(BEST_NON_SURPRISING[sum], i3);
                    }
                }
            }
        }
    }

    private static int get(int pos, int s) {
        if (s < 0) {
            return -INF;
        }

        if (pos == n) {
            return s == 0 ? 0 : -INF;
        }

        if (dp[pos][s] != -1) {
            return dp[pos][s];
        }

        int bestNonSurprising = BEST_NON_SURPRISING[scores[pos]];
        int bestSurprising = BEST_SURPRISING[scores[pos]];

        int result = get(pos + 1, s) + (bestNonSurprising >= p ? 1 : 0);
        if (bestSurprising != -1) {
            result = Math.max(result, get(pos + 1, s - 1) + (bestSurprising >= p ? 1 : 0));
        }

        return dp[pos][s] = result;
    }
}
