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 collections
import heapq

def constructGraph(n, edges):

    graph = collections.defaultdict(list)
    inDegree = [0 for _ in range(n)]

    for edge in edges:
        a, b = edge[0]-1, edge[1]-1
        graph[b].append(a)
        inDegree[a] += 1

    return [graph, inDegree]

def solve(n, edges):

    graph, inDegree = constructGraph(n, edges)
    answer = [0 for _ in range(n)]
    pq = []

    for i in range(n):
        if inDegree[i] == 0:
            heapq.heappush(pq, -i)

    current = n
    while pq:
        currentNode = -heapq.heappop(pq)
        answer[currentNode] = current
        current -= 1

        if currentNode not in graph:
            continue

        for neighNode in graph[currentNode]:
            inDegree[neighNode] -= 1

            if inDegree[neighNode] == 0:
                heapq.heappush(pq, -neighNode)

    return answer

n, m = map(int, input().split())
edges = []

for _ in range(m):
    edges.append(list(map(int, input().split())))

print(*solve(n, edges), sep = ' ')
