6_C

def DFS(initial_v, vertices, graph):
    if vertices[initial_v] == 'white':
        vertices[initial_v] = 'gray'
        print(initial_v, end=' ')
        adjacent = graph[initial_v]
        for v in adjacent:
            DFS(v, vertices, graph)


n, m = map(int, input().split())
vertices = ['white' for vertice in range(n + 1)]
G = {vertice: [] for vertice in range(1, n + 1)}
for e in range(m):
    v, w = map(int, input().split())
    G[v].append(w)
    G[w].append(v)
for v in G:
    G[v].sort()


initial = int(input())
DFS(initial, vertices, G)