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 
from queue import Queue
import heapq

n, m = input().split()
n = int(n)
m = int(m)

f = [0] * (n + 1)
sol = [0] * (n + 1)
adya = [[] for _ in range(n + 1)]

for i in range(m):
    n1, n2 = input().split()
    n1 = int(n1)
    n2 = int(n2)
    adya[n2].append(n1)
    f[n1] += 1

cola = []
cnt = 0

for i in range(1, n + 1):
    if(f[i] == 0):
        heapq.heappush(cola, -1 * i)
        cnt += 1
num = int(n)
while(cnt > 0):
    v = heapq.heappop(cola)
    v *= -1
    sol[v] = num
    cnt -= 1
    num -= 1
    for to in adya[v]:
        f[to] -= 1
        if(f[to] == 0):
            heapq.heappush(cola, -1 * to)
            cnt += 1

stringOut = ""
for i in range(1, n + 1):
    stringOut += str(sol[i])
    if(i != n):
        stringOut += ' '
        
print(stringOut)