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 com.khajochi.codejam;

import java.io.BufferedReader;
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Arrays;

public class DancingWithTheGooglers
{

	/**
	 * @param args
	 */
	public static void main(String[] args)
	{
		try
		{
			RecycledNumbers sp = new RecycledNumbers();

			FileInputStream fstream = new FileInputStream("/Users/msmart/Documents/My Work/Workspace/M/resource/2012round1/1BSmall.in");
			DataInputStream in = new DataInputStream(fstream);
			BufferedReader br = new BufferedReader(new InputStreamReader(in));
			String str = br.readLine();
			int count = 1;
			while ((str = br.readLine()) != null)
			{
//				System.out.println(str);
				
				String[] strSpilt = str.split(" ");
				
				int numInput = Integer.parseInt(strSpilt[0]);
				int numSurprise = Integer.parseInt(strSpilt[1]);
				int sum = Integer.parseInt(strSpilt[2]);
				
				int[] allInput = new int[numInput];
				
				for (int i = 0; i < numInput; i++)
				{
					allInput[i] = Integer.parseInt(strSpilt[i+3]);
//					System.out.println(allInput[i]);
				}
				
				int ans = 0;
				
				Arrays.sort(allInput);
				
				for (int i = 0; i < allInput.length; i++)
				{
					if ( allInput[i] >= sum * 3 )
					{
						ans++;
						continue;
					}
					
					if ( sum * 3 - 2 < 0 )
					{
						continue;
					}
					else if (allInput[i] >= sum * 3 - 2 )
					{
						ans++;
						continue;
					}
					
					if ( sum * 3 - 4 < 0 )
					{
						continue;
					}
					else if (allInput[i] >= sum * 3 - 4 && numSurprise > 0 )
					{
						ans++;
						numSurprise--;
						continue;
					}
					
				}
//				System.out.println(ans);
				
				System.out.println("Case #" + count++ + ": " + ans);
				
			}
			in.close();
		}
		catch (Exception e)
		{
			System.err.println(e);
		}
	
	}

}
