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

import java.util.Scanner;

import codejam2.CodejamCase;
import codejam2.CodejamRunner;

public class Dancing extends CodejamRunner implements CodejamCase {

	private int nGooglers;
	private int surprising;
	private int pointMin;
	private int[] points;
	private String result;
	@Override
	public void compute() {
		int ns = 0;
		int s = 0;
		
		for(int i = 0; i < nGooglers; i++) {
			if(points[i] >= 3*pointMin-2)
				ns++;
			else if(pointMin>1 && points[i] >= 3*pointMin-4)
				s++;
		}
		result = String.valueOf(ns + Math.min(s, surprising));

	}

	@Override
	public String getOutput() {
		return result;
	}

	@Override
	public CodejamCase parseCase(Scanner s) {
		Dancing d = new Dancing();
		d.nGooglers = s.nextInt();
		d.surprising = s.nextInt();
		d.pointMin = s.nextInt();
		d.points = new int[d.nGooglers];
		for(int i = 0; i < d.nGooglers; i++)
			d.points[i] = s.nextInt();
		return d;
	}

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		new Dancing().run(args);
	}

}
