import java.util.List;


public class Case implements Runnable {

	private int id;
	private String output;

	private int n;
	private int s;
	private int p;
	private List<Integer> g;

	public Case(int id) {
		this.id = id;
	}

	public Case(int id, int n, int s, int p, List<Integer> g) {
		super();
		this.id = id;
		this.n = n;
		this.s = s;
		this.p = p;
		this.g = g;
	}

	public String solve() {
		int res = 0;
		for (int googler : g) {
			int b = googler / 3;
			boolean div = googler % 3 == 0;
			if (b >= p) {
				res++;
				continue;
			}
			if (p == b+1) {
				if (div && s > 0 && b > 0) {
					res++;
					s--;
					continue;
				}
				if (!div) {
					res++;
					continue;
				}
			}
			if (p == b+2) {
				if (3*b+2 == googler && s > 0) {
					res++;
					s--;
				}
			}
		}
		return String.valueOf(res);
	}

	@Override
	public void run() {
		output = solve();
	}

	@Override
	public String toString() {
		return "Case #" + id + ": " + output;
	}

}
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;
	}
}
