from collections import deque

n, m = [int(x) for x in input().split()]
uv = [[int(x) - 1 for x in input().split()] for _ in range(m)]

g = [[] for _ in range(n)]
for ui, vi in uv:
	g[ui].append(vi)
	g[vi].append(ui)

if len(g[0]) == 0:
	for _ in range(n):
		print(0)
	exit()

large = 10 ** 10

d = [large] * n
d[0] = 0

q = deque()
q.append(0)

while q:
	cur = q.popleft()
	for nxt in g[cur]:
		if d[nxt] >= large:
			d[nxt] = d[cur] + 1
			q.append(nxt)
			
odd = [0] * (n + 1)
even = [0] * (n + 1)

for di in d:
	if di < large:
		if di % 2 == 0:
			even[di] += 1
		else:
			odd[di] += 1
			
for i in range(n):
	odd[i+1] += odd[i]
	even[i+1] += even[i]
	
	if (i + 1) % 2 == 0:
		print(even[i+1])
	else:
		print(odd[i+1])