#include <bits/stdc++.h>
using namespace std;

void fast_io() {
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
}

int main() {
	fast_io();
	int n, m;
	cin >> n >> m;
	vector<vector<int>> g(n);
	for (int i = 0; i < m; i++) {
		int u, v;
		cin >> u >> v;
		u--, v--;
		g[u].push_back(v);
		g[v].push_back(u);
	}
	if (g[0].empty()) {
		for (int i = 0; i < n; i++) {
			cout << "0\n";
		}
		return 0;
	}
	vector<int> dist(n, -1);
	dist[0] = 0;
	deque<int> dq;
	dq.push_back(0);
	while (!dq.empty()) {
		int u = dq.front();
		dq.pop_front();
		for (int v : g[u]) {
			if (dist[v] == -1) {
				dist[v] = dist[u] + 1;
				dq.push_back(v);
			}
		}
	}
	vector<int> ans(n + 1, 0);
	for (int i = 0; i < n; i++) {
		if (dist[i] != -1) {
			ans[dist[i]]++;
		}
	}
	for (int i = 2; i <= n; i++) {
		ans[i] += ans[i - 2];
	}
	for (int i = 1; i <= n; i++) {
		cout << ans[i] << "\n";
	}
}