import sys
sys.setrecursionlimit(10**6)

class UnionFind():
	def __init__(self, n):
		self.size = n
		self.root = [-1 for _ in range(n+1)]
		self.rnk = [0 for _ in range(n+1)]

	def findRoot(self, a):
		if self.root[a] < 0:
			return a
		else:
			return self.findRoot(self.root[a])

	def uniteTree(self, a, b):
		a = self.findRoot(a)
		b = self.findRoot(b)
		if a == b:
			return

		a_elemets = self.root[a] * (-1)
		b_elemets = self.root[b] * (-1)

		if a_elemets == b_elemets:
			sup = min(a,b)
			inf = max(a,b)
		elif a_elemets > b_elemets:
			sup = a
			inf = b
		else:
			sup = b
			inf = a

		self.root[sup] += self.root[inf]
		self.root[inf] = sup



	def judgeTree(self, a, b):
		return self.findRoot(a) == self.findRoot(b)

	def count(self, a):
		return self.rnk[self.findRoot(a)] * (-1)


N, M = map(int, input().split())
A = []
B = []

for i in range(M):
	a_tmp, b_tmp = map(int, input().split())
	A.append(a_tmp)
	B.append(b_tmp)

monkey = UnionFind(N)

for i in range(M):
	monkey.uniteTree(A[i], B[i])

for i in range(1,N+1):
	if monkey.root[i] < 0:
		print(i)
	else:
		print(monkey.findRoot(i))