from collections import deque
from itertools import accumulate

INF = float("inf")

N, M = map(int, input().split())
graph = [[] for _ in range(N)]

for _ in range(M):
    u, v = map(lambda x: int(x) - 1, input().split())
    graph[u].append(v)
    graph[v].append(u)

dist = [INF] * N
dist[0] = 0
que = deque([0])

while que:
    now_v = que.popleft()

    for next_v in graph[now_v]:
        if dist[next_v] != INF:
            continue
        dist[next_v] = dist[now_v] + 1
        que.append(next_v)

if dist.count(INF) == N - 1:
    for _ in range(N):
        print(0)

odd = [0] * (N + 1)
even = [0] * (N + 1)

for i in range(N):
    if dist[i] == INF:
        continue

    if dist[i] % 2 == 0:
        even[dist[i]] += 1
    else:
        odd[dist[i]] += 1

acc_odd = list(accumulate(odd))
acc_even = list(accumulate(even))

for i in range(1, N + 1):
    if i % 2 == 0:
        print(acc_even[i])
    else:
        print(acc_odd[i])