from collections import*
from heapq import*
(n,m),*e=[[*map(int,s.split())]for s in open(0)]
g=[[]for _ in range(n)]
for u,v in e:
  g[u-1]+=v-1,
  g[v-1]+=u-1,
q=[(0,0)]
INF=1<<60
s=[INF]*n
s[0]=0
while q:
  c,p=heappop(q)
  if s[p]<c:
    continue
  for v in g[p]:
    if s[v]>c+1:
      s[v]=c+1
      q+=(c+1,v),
c=Counter(s)
t=0
d=[1,0]
for i in range(n):
  t^=1
  d[(i+1)%2]+=c[i+1]
  print(d[t])