/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

/*
 * Dancing
 * Jason Bradley Nel
 * 16287398
 */
import java.io.*;

public class Dancing {

    public static void main(String[] args) {

        In input = new In("input.txt");
        int T = Integer.parseInt(input.readLine());

        for (int i = 0; i < T; i++) {
            System.out.printf("Case #%d: ", i + 1);
            int N = input.readInt();
            int s = input.readInt();
            int p = input.readInt();
            int c = 0;//counter for >=p cases
            //System.out.printf("N: %d, S: %d, P: %d, R: ", N, s, p);
            
            for (int j = 0; j < N; j++) {
                
                int score = input.readInt();
                int q = score / 3;
                int m = score % 3;
                //System.out.printf("%2d (%d, %d) ", scores[j], q, m);
                                
                switch (m) {
                    case 0:
                        if (q >= p) {
                            c++;
                        } else if (((q + 1) == p) && (s > 0) && (q != 0)) {
                            c++;
                            s--;
                        }
                        break;
                    case 1:
                        if (q >= p) {
                            c++;
                        } else if ((q + 1) == p) {
                            c++;
                        }
                        break;
                    case 2:
                        if (q >= p) {
                            c++;
                        } else if ((q + 1) == p) {
                            c++;
                        } else if (((q + 2) == p) && (s > 0)) {
                            c++;
                            s--;
                        }
                        break;
                }
            }
            //System.out.printf("Best result of %d or higher: ", p);
            System.out.println(c);
        }


    }
}

import java.util.Scanner;


public class B {

    static int[][] dp; // dp[i][j]: iäººç®ã¾ã§çµãã£ãã»ãã¨jåsurprize
    static void solve(int casee, Scanner sc) {
        int n = sc.nextInt();
        int s = sc.nextInt();
        int p = sc.nextInt();
        int[] t = new int[n];
        for (int i = 0; i < n; i++) {
            t[i] = sc.nextInt();
        }
        dp = new int[n+1][s+1];
        for (int i = 0; i < n; i++) {
            boolean alwaysGood = (t[i] + 2) / 3 >= p;
            boolean goodWhenSurprizing = p == 0 || t[i] >= 2 && (t[i] + 4) / 3 >= p;
            if (alwaysGood) {
                for (int j = s; j >= 0; j--) {
                    dp[i+1][j] = dp[i][j] + 1;
                }
            }
            else if (goodWhenSurprizing) {
                for (int j = s; j >= 0; j--) {
                    dp[i+1][j] = dp[i][j];
                }
                for (int j = s; j >= 1; j--) {
                    dp[i+1][j-1] = Math.max(dp[i+1][j-1], dp[i][j] + 1);
                }
            }
            else {
                for (int j = s; j >= 0; j--) {
                    dp[i+1][j] = dp[i][j];
                }
            }
        }
        int max = 0;
        for (int i = 0; i <= s; i++) {
            max = Math.max(max, dp[n][i]);
        }
        System.out.println("Case #" + (casee+1) + ": " + max);
    }
    
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int t = sc.nextInt();
        for (int i = 0; i < t; i++) {
            solve(i, sc);
        }
        
    }

}
