/**
 * 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 cj2012;

import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.util.Scanner;
import java.util.StringTokenizer;

public class B {

	public static void main(String[] args) throws NumberFormatException,
			IOException {
		BufferedReader buffer = new BufferedReader(new FileReader(
				"B-small-attempt0.in"));
		int t = Integer.parseInt(buffer.readLine());
		for (int i = 0; i < t; i++) {
			String kase = buffer.readLine();
			StringTokenizer tokenizer = new StringTokenizer(kase);
			int n = Integer.parseInt(tokenizer.nextToken());
			int s = Integer.parseInt(tokenizer.nextToken());
			int p = Integer.parseInt(tokenizer.nextToken());
			int[] scores = new int[n];
			for (int j = 0; j < scores.length; j++) {
				scores[j] = Integer.parseInt(tokenizer.nextToken());
			}
			boolean done = false;
			int solution = 0, sdash = 0;
			int x = 0;
			for (int k = 0; k < n && !done; k++) {
				int make = make(scores[k], p);
				if (make == 0)
					x++;
				else if (make == 1 && s > sdash) {
					x++;
					sdash++;
				}
			}
			solution = x;
			System.out.printf("Case #%d: %d\n", (i + 1), solution);
		}
	}

	private static int make(int i, int p) {
		i -= p;
		if (i > 2 * p)
			return 0;
		if (i < 0)
			return -1;
		if (i > 2 * p - 3 && i < 2 * p + 3)
			return 0;
		if (i > 2 * p - 5 && i < 2 * p + 5)
			return 1;

		return -1;
	}
}
