class Unionfind:
    def __init__(self, N):
        self.par = [-1] * N
    
    def root(self, x):
        if self.par[x] < 0:
            return x
        
        self.par[x] = self.root(self.par[x])
        return self.par[x]
    
    def unite(self, x, y):
        rx, ry = self.root(x), self.root(y)
        
        if rx != ry:
            rx_num, ry_num = -self.par[rx], -self.par[ry]
            
            if rx_num > ry_num or (rx_num == ry_num and rx < ry):
                self.par[rx] += self.par[ry]
                self.par[ry] = rx
            elif ry_num > rx_num or (rx_num == ry_num and ry < rx):
                self.par[ry] += self.par[rx]
                self.par[rx] = ry
            
N, M = map(int, input().split())
uf = Unionfind(N)

for _ in range(M):
    Ai, Bi = map(int, input().split())
    uf.unite(Ai-1, Bi-1)

for i in range(N):
    print(uf.root(i)+1)