N,M = map(int,input().split())
apes = [[i,1]for i in range(N+1)]

def bossfind(ape):
    if apes[ape][0]==ape:
        return ape
    else:
        apes[ape][0] = bossfind(apes[ape][0])
        return apes[ape][0]

for i in range(M):
    ape1,ape2 = map(int,input().split())
    boss1,boss2 = bossfind(ape1),bossfind(ape2)
    if boss1==boss2:
        continue
    elif apes[boss1][1]==apes[boss2][1]:
        win,lose = min(boss1,boss2),max(boss1,boss2)
    elif apes[boss1][1]>apes[boss2][1]:
        win,lose = boss1,boss2
    else:
        win,lose = boss2,boss1
    apes[win][1] += apes[lose][1]
    apes[lose][0] = win

for i in range(1,N+1):
    print(bossfind(i))