You are given a directed acyclic graph with n vertices and m edges. There are no self-loops or multiple edges between any pair of vertices. Graph can be disconnected. You should assign labels to all vertices in such a way that: Find such sequence of labels to satisfy all the conditions. The first line contains two integer numbers n, m (2 ≤ n ≤ 105, 1 ≤ m ≤ 105). Next m lines contain two integer numbers v and u (1 ≤ v, u ≤ n, v ≠ u) -- edges of the graph. Edges are directed, graph doesn't contain loops or multiple edges. Print n numbers -- lexicographically smallest correct permutation of labels of vertices.