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

import java.util.Scanner;

import common.ISolver;
import common.QuestionHandler;

public class GoggleDancing implements ISolver {

	@Override
	public String solve(String problem) {
		Scanner scan = new Scanner(problem);
		int nGogglers = scan.nextInt();
		int suprising = scan.nextInt();
		int pLeastBest = scan.nextInt();
		int maxWithLeastBest = 0;
		
		int minScoreSum = pLeastBest + 2*(Math.max(pLeastBest-1, 0));
		int minScoreSumWithSurprise = pLeastBest + 2*(Math.max(pLeastBest-2, 0));
		for (int i=0; i<nGogglers; ++i) {
			int sumScore = scan.nextInt();
			if (sumScore >= minScoreSum) {
				++maxWithLeastBest;
			} else if (suprising > 0 && sumScore >= minScoreSumWithSurprise) {
				++maxWithLeastBest;
				--suprising;
			}
		}
		return String.valueOf(maxWithLeastBest);
	}

	@Override
	public void addCase(String problem, String answer) {
		String myAnswer = solve(problem);
		if (!myAnswer.equals(answer)) {
			throw new RuntimeException("Invalid prediction");
		}
		
	}

	public static void main(String[] args) {
		QuestionHandler questionHandler = new QuestionHandler(new GoggleDancing());
		questionHandler.addResource("sample.in", "sample.out");
		
		System.out.println("Sample input:");
		questionHandler.solve("sample.in", "sample.out");
		
		System.out.println("\nSmall input:");
		questionHandler.solve("small.in", "small.out");
	}
}
