import collections
import heapq


N,M = map(int, input().split())
UV = [list(map(int, input().split())) for _ in range(M)]
L = [[] for _ in range(N)]
for u,v in UV:
    L[u-1].append(v-1)
    L[v-1].append(u-1)
check = set()
next = set()
check.add(0)
next.add(0)
odd = 0
even = 1
for i in range(N):
    nnext = set()
    for v in next:
        for l in L[v]:
            if not l in check:
                nnext.add(l)
                check.add(l)
    if i%2==0:
        odd+=len(nnext)
        print(odd)
    else:
        even+=len(nnext)
        print(even)
    next = nnext