class __UnionFind(object):
    def __init__(self, n=1):
        self.par = [i for i in range(n)]
        self.rank = [0 for _ in range(n)]
        self.size = [1 for _ in range(n)]

    def find(self, x):
        if self.par[x] == x:
            return x
        else:
            self.par[x] = self.find(self.par[x])
            return self.par[x]

    def union(self, x, y):
        x = self.find(x)
        y = self.find(y)
        if x != y:
            # if self.rank[x] < self.rank[y]:
            #     x, y = y, x
            # if self.rank[x] == self.rank[y]:
            #     self.rank[x] += 1
            if self.get_size(x) == self.get_size(y):
                if x > y:
                    x, y = y, x
            else:
                if self.get_size(x) < self.get_size(y):
                    x, y = y, x                    
            self.par[y] = x
            self.size[x] += self.size[y]

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

    def get_size(self, x):
        x = self.find(x)
        return self.size[x]

N, M = map(int, input().split())
L = list(range(N))
U = __UnionFind(N)
for i in range(M):
    A, B = map(int, input().split())
    A, B = A - 1, B - 1
    U.union(A, B)
    
for i in range(N):
    print(U.find(i) + 1)