class UnionFind():
    def __init__(self, n):
        self.n = n
        self.parents = [-1] * n
        self.__group_count = n
        
    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 = self.find(x)
        y = self.find(y)

        if x == y:
            return
        
        self.__group_count -= 1
        
        if self.parents[x] > self.parents[y]:
            x, y = y, x

        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) 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 self.__group_count
    
N, M = map(int, input().split())
AB = [list(map(int, input().split())) for _ in range(M)]

uf = UnionFind(N)

boss = [i for i in range(N)]
for i in range(M):
    a, b = AB[i]
    a -= 1
    b -= 1
    if uf.same(a, b):
        continue
    for x in [a, b]:
        if uf.size(x) == 1:
            boss[x] = x

    if uf.size(a) > uf.size(b):
        v = boss[uf.find(a)]
    elif uf.size(a) < uf.size(b):
        v = boss[uf.find(b)]
    else:        
        v = min(boss[uf.find(a)], boss[uf.find(b)])
    uf.union(a, b)
    boss[uf.find(a)] = v
        
ans = []
for i in range(N):
    ans.append(boss[uf.find(i)] + 1)
print(*ans, sep='\n')