from collections import deque

n,m = map(int,input().split())
graph = [[] for _ in range(60010)]
vis = set()
for i in range(m):
    x,y = map(int,input().split())
    graph[x].append(y)
for i in range(60010):
    if graph[i]:
        graph[i].sort()

def dfs(x):
    global vis
    if x not in vis:
        print(x,end=' ')
        vis.add(x)
    for i in graph[x]:
        if i in vis:
            continue
        else:
            dfs(i)

dfs(1)
print()
vis.clear()
Q = deque([1])
while Q:
    a = Q.popleft()
    if a not in vis:
        print(a,end=' ')
        vis.add(a)
        for i in graph[a]:
            if i not in vis:
                Q.append(i)