N,M=map(int,input().split())

P=[i for i in range(N+1)]
S=[1 for i in range(N+1)]
p=[i for i in range(N+1)]

def find(a):
    if P[a]==a:
        return a
    else:
        return find(P[a])
        
def union(b,c):
    B=find(b)
    C=find(c)
    if P[B]==P[C]:
        pass
    elif S[B]>S[C]:
        S[B]+=S[C]
        P[C]=P[B]
    elif S[C]>S[B]:
        S[C]+=S[B]
        P[B]=P[C]
    else:
        if p[B]<p[C]:
            S[B]+=S[C]
            P[C]=P[B]
        else:
            S[C]+=S[B]
            P[B]=P[C]
            
for i in range(M):
    a,b=map(int,input().split())
    union(a,b)
    #print(P,S)
#print(P)
for i in range(1,N+1):
    print(find(i))