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

package aao;

import java.io.*;
import java.util.regex.Pattern;

/**
 * @author aoboturov
 */
public class DansingWithGooglers {

    public LineNumberReader lineNumberReader;

    public DansingWithGooglers(final String inputFileName) throws Exception {
        lineNumberReader = new LineNumberReader(
                new BufferedReader(
                        new InputStreamReader(
                                getClass().getClassLoader().getResourceAsStream(inputFileName)
                        )
                ));
    }

    public int readNumberOfTestCases() throws Exception {
        return Integer.parseInt(lineNumberReader.readLine());
    }

    public void solve(final String outputFileName) throws Exception {
        final FileOutputStream fos = new FileOutputStream(new File(outputFileName));

        final int numberOfTestCases = readNumberOfTestCases();
        final Pattern pattern = Pattern.compile("[\\s]+");
        for ( int caseNumber = 1; caseNumber <= numberOfTestCases; caseNumber++) {
            // Init of counters.
            int guaranteedNumberOfGooglersHavingBestResult = 0;
            int holdOutNumberOfGooglersHavingBestResult = 0;
            // Init of base parameters.
            final String[] splitInput = pattern.split(lineNumberReader.readLine());
            final int numberOfGooglers = Integer.parseInt(splitInput[0]);
            final int numberOfSurprises = Integer.parseInt(splitInput[1]);
            final int requiredBestResult = Integer.parseInt(splitInput[2]);
            // Compute required values.
            for ( int googler = 0; googler < numberOfGooglers; googler++) {
                final int googlerScore = Integer.parseInt(splitInput[3 + googler]);
                // Filter evident cases:
                if ( googlerScore >= 3*requiredBestResult) {
                    guaranteedNumberOfGooglersHavingBestResult++;
                    continue;
                }
                if ( googlerScore <= (3*requiredBestResult - 5)) {
                    continue;
                }
                // case p=k,k,k
                if ( googlerScore == (3*requiredBestResult - 0)) {
                    guaranteedNumberOfGooglersHavingBestResult++;
                    continue;
                }
                // case p=k,k+1,k+1
                if ( googlerScore == (3*requiredBestResult - 1) && (googlerScore - 2) >= 0) {
                    guaranteedNumberOfGooglersHavingBestResult++;
                    continue;
                }
                // case p=k,k,k+1
                if ( googlerScore == (3*requiredBestResult - 2) && (googlerScore - 1) >= 0) {
                    guaranteedNumberOfGooglersHavingBestResult++;
                    continue;
                }
                // case p=k,k+1,k+2
                if ( googlerScore == (3*requiredBestResult - 3) && (googlerScore - 3) >= 0) {
                    holdOutNumberOfGooglersHavingBestResult++;
                    continue;
                }
                // case p=k,k+2,k+2
                if ( googlerScore == (3*requiredBestResult - 4) && (googlerScore - 2) >= 0) {
                    holdOutNumberOfGooglersHavingBestResult++;
                    continue;
                }
            }
            final StringBuilder sb = new StringBuilder("Case #").append(caseNumber).append(": ")
                    .append(guaranteedNumberOfGooglersHavingBestResult+Math.min(holdOutNumberOfGooglersHavingBestResult, numberOfSurprises))
                    .append("\n");
            System.out.print(sb.toString());
            fos.write(sb.toString().getBytes());
        }
    }


    public static void main(String args[]) throws Exception {
        new DansingWithGooglers("B-small-attempt0.in.txt").solve("output.xml");
    }
}
