line=input().split()
n=int(line[0])
m=int(line[1])

node=[i for i in range(n)]
size=[1 for i in range(n)]

def root(a):
    if node[a]==a:
        return a
    else:
        return root(node[a])
        
def u(a,b):
    size[a]+=size[b]
    node[b]=a

def union(a,b):
    a=root(a)
    b=root(b)
    if a!=b:
        if size[a]>size[b]:
            u(a,b)
        elif size[a]<size[b]:
            u(b,a)
        else:
            if a<b:
                u(a,b)
            else:
                u(b,a)
                
for i in range(m):
    line=input().split()
    a=int(line[0])-1
    b=int(line[1])-1
    union(a,b)
    
for i in node:
    print(root(i)+1)