from collections import deque

def bfs(v):
    dq = deque([(v,0)])
    now_d = 1
    cnt0 = set()
    cnt1 = set()
    cnt0.add(v)
    while dq:
        v,d = dq.popleft()
        if d > now_d:
            print(len(cnt1))
            cnt0 = set(cnt1)
            cnt1 = set()
            now_d = d
        if d > n:
            return
        if v not in cnt0:
            cnt1.add(v)
        for nv in g[v]:
            dq.append((nv,d+1))

n,m = map(int,input().split())
g = [[] for _ in range(n)]
for _ in range(m):
    u,v = map(int,input().split())
    g[u-1].append(v-1)
    g[v-1].append(u-1)
bfs(0)