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