from collections import deque n,k,s=map(int,input().split()) arr=[[] for t in range(n+1)] for _ in range(k): a,b=map(int,input().split()) arr[a].append(b) arr[b].append(a) visited=[0]*(n+1) visited2=[0]*(n+1) def dfs(st): visited[st]=1 print(st,end=" ") arr[st].sort() for i in arr[st]: if visited[i]==0: dfs(i) def bfs(sta): visited2[sta]=1 queue = deque() queue.append(sta) while queue: w=queue.p..