4 4
1 2
1 3
2 4
3 4

1 2 3 4

from collections import deque
n, m = map(int, input().split())
graph = [[] for _ in range(n+1)]
indegree = [0] * (n+1)
for _ in range(m):
    u, v = map(int, input().split())
    graph[u].append(v)
    indegree[v] += 1
q = deque([i for i in range(1, n+1) if indegree[i] == 0])
result = []
while q:
    node = q.popleft()
    result.append(node)
    for nxt in graph[node]:
        indegree[nxt] -= 1
        if indegree[nxt] == 0:
            q.append(nxt)
print(*result)