from collections import deque
import sys
int1 = lambda x: int(x) - 1
# input = lambda: sys.stdin.buffer.readline()
input = lambda: sys.stdin.readline().rstrip()
ii = lambda: int(input())
i1 = lambda: int1(input())
mi = lambda: map(int, input().split())
mi1 = lambda: map(int1, input().split())
li = lambda: list(mi())
li1 = lambda: list(mi1())
lli = lambda n: [li() for _ in range(n)]
INF = float("inf")
mod = int(1e9 + 7)
# mod = 998244353
class dsu:
n = 1
parent_or_size = [-1 for i in range(n)]
def __init__(self, N):
self.n = N
self.parent_or_size = [-1 for i in range(N)]
def merge(self, a, b):
assert 0 <= a < self.n, "0<=a<n,a={0},n={1}".format(a, self.n)
assert 0 <= b < self.n, "0<=b<n,b={0},n={1}".format(b, self.n)
x = self.leader(a)
y = self.leader(b)
if x == y:
return x
if -self.parent_or_size[x] < -self.parent_or_size[y]:
x, y = y, x
self.parent_or_size[x] += self.parent_or_size[y]
self.parent_or_size[y] = x
return x
def same(self, a, b):
assert 0 <= a < self.n, "0<=a<n,a={0},n={1}".format(a, self.n)
assert 0 <= b < self.n, "0<=b<n,b={0},n={1}".format(b, self.n)
return self.leader(a) == self.leader(b)
def leader(self, a):
assert 0 <= a < self.n, "0<=a<n,a={0},n={1}".format(a, self.n)
if self.parent_or_size[a] < 0:
return a
self.parent_or_size[a] = self.leader(self.parent_or_size[a])
return self.parent_or_size[a]
def size(self, a):
assert 0 <= a < self.n, "0<=a<n,a={0},n={1}".format(a, self.n)
return -self.parent_or_size[self.leader(a)]
def groups(self):
leader_buf = [0 for i in range(self.n)]
group_size = [0 for i in range(self.n)]
for i in range(self.n):
leader_buf[i] = self.leader(i)
group_size[leader_buf[i]] += 1
result = [[] for i in range(self.n)]
for i in range(self.n):
result[leader_buf[i]].append(i)
result2 = []
for i in range(self.n):
if len(result[i]) > 0:
result2.append(result[i])
return result2
n, q = mi()
uf = dsu(n)
g = [list() for i in range(n)]
for i in range(q):
query = tuple(mi1())
if len(query) == 3:
t, u, v = query
if not uf.same(u, v):
g[u].append(v)
g[v].append(u)
uf.merge(u, v)
else:
t, u = query
que = deque([(u, -1)])
res = [u]
while que:
cur, pre = que.popleft()
for to in g[cur]:
if to == pre:
continue
que.append((to, cur))
res.append(to)
print(*sorted(list(map(lambda x: x + 1, res))))