from collections import deque

def bfs(v):
    dq = deque([(v,0)])
    while dq:
        v,d = dq.popleft()
        if d > n:
            return
        if v not in cnt[d-1]:
            cnt[d].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)
cnt = [set() for _ in range(n+1)]
bfs(0)
for i in cnt[1:]:
    print(len(i))