from collections import deque
n,m = map(int,input().split())
adj = [[] for _ in range(n)]
for _ in range(m):
    u,v = map(int,input().split())
    adj[u-1].append(v-1); adj[v-1].append(u-1)
d = [0]+[n]*(n-1); c = [1]+[0]*n; dq = deque([0])
while dq:
    p = dq.popleft()
    for v in adj[p]:
        if d[v]==n: d[v] = d[p]+1; c[d[v]] += 1; dq.append(v)
for i in range(n-1): c[i+2] += c[i]
print(*c[1:] if c[1] else [0]*n,sep="\n")