#仁義なき猿たち
#unionfindで同じグループで最も大きいものを返す


class UnionFind():
    def __init__(self, n):
        self.n = n
        self.parents = [-1 for i in range(n+1)] 

    def find(self, x):
        if self.parents[x] < 0:
            return x
        else:
            self.parents[x] = self.find(self.parents[x])
            return self.parents[x]

    def union(self, x, y):
        #xを親としてyを融合
        x = self.find(x)
        y = self.find(y)
        if x == y:
            return
        self.parents[x] += self.parents[y]
        self.parents[y] = x

    def size(self, x):
        return -self.parents[self.find(x)]

    def same(self, x, y):
        return self.find(x) == self.find(y)

    def members(self, x):
        root = self.find(x)
        return [i for i in range(self.n + 1) if self.find(i) == root]

    def roots(self):
        return [i for i, x in enumerate(self.parents) if x < 0]

    def group_count(self):
        return len(self.roots())

    def all_group_members(self):
        return {r: self.members(r) for r in self.roots()}

    def __str__(self):
        return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())


N, M = map(int, input().split())
U = UnionFind(N)
for _ in range(M):
    a, b = map(int, input().split())
    if U.size(a) == U.size(b):
        if U.find(a)>U.find(b):
            U.union(b,a)
        else:
            U.union(a,b)
    elif U.size(a) > U.size(b):
        U.union(a, b)
    elif U.size(b) > U.size(a):
        U.union(b, a)

for i in range(1, N+1):
    print(U.find(i))