import sys
input = sys.stdin.readline

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

# UnionFind

Group = [i for i in range(N+1)] # グループ分け
Nodes = [1]*(N+1) # 各グループのノードの数
ANS=[i for i in range(N+1)]

def find(x):
    while Group[x] != x:
        x=Group[x]
    return x

def Union(x,y):
    if find(x) != find(y):
        if Nodes[find(x)] < Nodes[find(y)]:
            
            Nodes[find(y)] += Nodes[find(x)]
            Nodes[find(x)] = 0
            Group[find(x)] = find(y)
            
        else:
            Nodes[find(x)] += Nodes[find(y)]
            Nodes[find(y)] = 0
            Group[find(y)] = find(x)

for i in range(M):
    a,b=map(int,input().split())

    x=Nodes[find(a)]
    y=Nodes[find(b)]

    if x<y:
        MIN=ANS[find(b)]
    elif x>y:
        MIN=ANS[find(a)]
    else:
        MIN=min(ANS[find(a)],ANS[find(b)])

    Union(a,b)
    ANS[find(a)]=MIN

for i in range(1,N+1):
    print(ANS[find(i)])