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

package gcj2012qr;

import java.io.*;
import java.util.*;
import java.util.concurrent.*;

import com.google.*;

/**
 * @author Roman Kosenko <madkite@gmail.com>
 */
public class DancingWithTheGooglers extends SingleThreadSolution<Object> {
	public static void main(String[] args) throws Exception {
		solve(new SolutionFactory<Object>() {
			public Callable<Object> read(BufferedReader br) throws IOException {
				String[] ss = br.readLine().split(" ");
				int n = Integer.parseInt(ss[0]);
				assert ss.length == n + 3;
				int s = Integer.parseInt(ss[1]);
				int p = Integer.parseInt(ss[2]);
				int[] t = new int[n];
				for(int i = 0; i < n; i++)
					t[i] = Integer.parseInt(ss[3 + i]);
				return new DancingWithTheGooglers(t, s, p);
			}
		}, "google/src/gcj2012qr/" + "B-small-attempt1.in");
	}
	private final int t[], s, p;
	public DancingWithTheGooglers(int[] t, int s, int p) {
		this.t = t;
		this.s = s;
		this.p = p;
	}
	public String call() throws Exception {
		int result = 0, surprises = s;
		//noinspection ForLoopReplaceableByForEach
		for(int i = 0; i < t.length; i++) {
			int max = (t[i] + 2) / 3;
			if(max + 1 == p && surprises > 0 && (t[i] % 3 == 2 || t[i] % 3 == 0 && t[i] > 0)) {
				surprises--;
				result++;
			} else if(max >= p)
				result++;
		}
		return Integer.toString(result);
	}
}
