from collections import deque

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

if len(g[0]) == 0: exit(print("0\n" * n, end=""))
d = [(1 << 30)] * n
d[0] = 0
q = deque([0])
while q:
    u = q.popleft()
    for v in g[u]:
        if d[v] > d[u] + 1:
            d[v] = d[u] + 1
            q.append(v)

cnt = [0] * (n+1)
for x in d:
    if x != 1 << 30:
        cnt[x] += 1
for i in range(n-1):
    cnt[i+2] += cnt[i]
print('\n'.join(map(str, cnt[1:])))