package util.graph;

import java.util.HashSet;
import java.util.PriorityQueue;
import java.util.Set;

public class DynDjikstra {
    public static State FindShortest(Node start, Node target) {
        PriorityQueue<Node> openSet = new PriorityQueue<>();
        Set<Node> closedSet = new HashSet<>();
        openSet.add(start);
        while (!openSet.isEmpty()) {
            Node current = openSet.poll();
            for (Edge edge : current.edges) {
                Node end = edge.target;
                if (closedSet.contains(end)) {
                    continue;
                }
                State newState = edge.travel(current.last);
                //if (end.equals(target)) {
                    //return newState;
                //}
                if (openSet.contains(end)) {
                    if (end.last.compareTo(newState)>0) {
                        end.last = newState;
                    }
                } else {
                    openSet.add(end);
                    end.last = newState;
                }
            }
            closedSet.add(current);
            if (closedSet.contains(target)) {
                return target.last;
            }
        }

        return target.last;
    }
}


public class DancingGooglers {

	private static int sc;

	private static int result = 0;
	
	private static int p;
	
	private static void check(int val) {
		int x = val % 3;
		int n = val / 3;
		if (x == 0) {
			if (n >= p) {
				result++;
			} else if (n > 0 && sc > 0 && n + 1 >= p) {
				result++;
				sc--;
			}
		} else {
			if (n + 1 >= p) {
				result++;
			} else if (x == 2 && n + 2 >= p && sc > 0) {
				result++;
				sc--;
			}
		}
	}
	
	public static void main(String[] args) throws Exception {
		String[] in = ProblemUtils.readInput("/home/laf/Downloads/B-small-attempt0.in");
		String[] out = new String[in.length];
		for (int i = 0; i < in.length; i++) {
			String[] vals = in[i].split(" ");
			int n = Integer.parseInt(vals[0]);
			sc = Integer.parseInt(vals[1]);
			p = Integer.parseInt(vals[2]);
			result = 0;
			for (int j = 3; j < 3 + n; j++) {
				check(Integer.parseInt(vals[j]));
				out[i] = "" + result;
			}
		}
		ProblemUtils.writeOutput("/home/laf/Desktop/out.txt", out);
	}
	
}
