测评记录 代码：

from collections import deque

def dfs(f):
    while ve[f]:
        xn = ve[f].pop()
        dfs(xn)
    ans.appendleft(f)

n, m = map(int, input().split())
ve = [[] for _ in range(10002)]
for _ in range(m):
    u, v = map(int, input().split())
    ve[u].append(v)
    ve[v].append(u)

ans = deque()
dfs(1)
for farm in ans:
    print(farm)