/**
 * Created by IntelliJ IDEA.
 * User: Administrator
 * Date: 3/3/12
 * Time: 11:00 AM
 * To change this template use File | Settings | File Templates.
 */

import SRMLib.MathLibrary;
import SRMLib.TestSRMLib;
import com.sun.org.apache.bcel.internal.generic.F2D;

import java.io.*;
import java.util.*;
import java.util.zip.Inflater;

public class SRM {
    public static void main(String[] args) throws IOException {
        //TestSRMLib.run();
        codeJam1.main();

        return;
    }
}
class codeJam1 {
    public static void main() throws IOException {
        String inputPath = "E:\\input.txt";
        String outputPath = "E:\\output.txt";
        BufferedReader input = new BufferedReader(new FileReader(inputPath));
        BufferedWriter output = new BufferedWriter(new FileWriter(outputPath));

        String line;
        line = input.readLine();
        int T = Integer.parseInt(line);
        for (int i = 1; i <= T; ++i) {
            line = input.readLine();
            String[] words = line.split(" ");
            int N = Integer.parseInt(words[0]);
            int S = Integer.parseInt(words[1]);
            int p = Integer.parseInt(words[2]);
            int n = 0;
            int res = 0;

            for (int j = 3; j < words.length; ++j) {
                if (p == 0) {
                    res++;
                    continue;
                }

                int t = Integer.parseInt(words[j]);
                if (p == 1) {
                    if (t > 0)
                        res++;
                    continue;
                }
                if (t >= 3 * p - 2)
                    res++;
                else if (t >= 3 * p - 4)
                    n++;
            }

            res += Math.min(n, S);
            output.write("Case #" + i + ": " + res);
            output.newLine();
        }

        input.close();
        output.close();
    }
}

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();
    }
}
