■ 해답 n, m, v = map(int, input().split()) graph = [[] for _ in range(n + 1)] for _ in range(m): a, b = map(int, input().split()) graph[a].append(b) graph[b].append(a) graph[a].sort() graph[b].sort() visited_dfs = [False] * (n + 1) visited_bfs = [False] * (n + 1) def dfs(graph, v, visited_dfs): visited_dfs[v] = True print(v, end = ' ') for i in graph[v]: if not visited_dfs[i]: dfs(graph, i, visite..