import times, strutils, sequtils, math, algorithm, tables, sets, lists, intsets
import critbits, future, strformat, deques
template `max=`(x,y) = x = max(x,y)
template `min=`(x,y) = x = min(x,y)
template `mod=`(x,y) = x = x mod y
template scan2 = (scan(), scan())
template scan3 = (scan(), scan())
let read* = iterator: string {.closure.} =
    while true: (for s in stdin.readLine.split: yield s)
proc scan(): int = read().parseInt
proc scanf(): float = read().parseFloat
proc toInt(c:char): int =
    return int(c) - int('0')



proc solve()=
  var
    n = scan()
    m = scan()
    ab = newseqwith(m,(scan()-1,scan()-1))
    rts = newseqwith(n,0)
    member = newseqwith(n,1)
  for i in 0..<n:
    rts[i] = i

  proc find(x:int):int=
    if rts[x]==x:
      return x
    else:
      result = find(rts[x])
      rts[x]=result
      return
  
  proc unite(x,y:int)=
    var
      rtx = find(x)
      rty = find(y)
    if rtx == rty:
      return
    if member[rtx]>member[rty]:
      member[rtx]+=member[rty]
      member[rty]=0
      rts[rty]=rtx
    elif member[rtx]<member[rty]:
      member[rty]+=member[rtx]
      member[rtx]=0
      rts[rtx]=rty
    else:
      if rtx < rty:
        rts[rty]=rtx
        member[rtx]+=member[rty]
        member[rty]=0
      else:
        rts[rtx]=rty
        member[rty]+=member[rtx]
        member[rtx]=0
    return 

  for (a,b) in ab:
    unite(a,b)
  
  for i in 0..<n:
    echo find(i)+1

  


  
  

  
solve()