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:

  * Labels form a valid permutation of length n — an integer sequence such that each integer from 1 to n appears exactly once in it. 
  * If there exists an edge from vertex v to vertex u then labelv should be smaller than labelu. 
  * Permutation should be lexicographically smallest among all suitable. 



Find such sequence of labels to satisfy all the conditions.

Input

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.

Output

Print n numbers — lexicographically smallest correct permutation of labels of vertices.

Examples

Input

3 3
1 2
1 3
3 2


Output

1 3 2 


Input

4 5
3 1
4 1
2 3
3 4
2 4


Output

4 1 2 3 


Input

5 4
3 1
2 1
2 3
4 5


Output

3 1 2 4 5 
import heapq
from bisect import bisect_left


class DirectedGraph:
    def __init__(self, n):
        self._num_nodes = n
        self._outflow_rate = [0 for i in xrange(n)]
        self._reversed_adj_lists = [[] for i in xrange(n)]

    def add_edge(self, u, v):
        self._outflow_rate[u] += 1
        self._reversed_adj_lists[v].append(u)

    def get_topological_labels(self):
        labels = [None for i in xrange(self._num_nodes)]

        zero_outflow_nodes = [u for u in xrange(self._num_nodes) if self._outflow_rate[u] == 0]

        next_label = self._num_nodes

        while len(zero_outflow_nodes) != 0:
            u = zero_outflow_nodes.pop()

            labels[u] = next_label

            next_label -= 1

            for v in self._reversed_adj_lists[u]:
                self._outflow_rate[v] -= 1

                if self._outflow_rate[v] == 0:
                    insertion_point = bisect_left(zero_outflow_nodes, v)

                    zero_outflow_nodes.insert(insertion_point, v)

        return labels


num_nodes, num_edges = map(int, raw_input().split(' '))

g = DirectedGraph(num_nodes)

for i in xrange(num_edges):
    u, v = map(lambda x: int(x) - 1, raw_input().split(' '))

    g.add_edge(u, v)

for label in g.get_topological_labels():
    print label,

print
