#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, m; cin >> n >> m;
	vector to(n, vector<int>());
	rep(i, m) {
		int u, v; cin >> u >> v;
		u--, v--;
		to[u].push_back(v);
		to[v].push_back(u);
	}
	vector<int>d(n, INF);
	d[0] = 0;
	queue<int>q;
	q.push(0);
	while (!q.empty()) {
		auto v = q.front();
		q.pop();
		for (auto nv : to[v]) {
			if (chmin(d[nv], d[v] + 1)) {
				q.push(nv);
			}
		}
	}
	vector<int>cnt(n + 2);
	rep(i, n)if(INF!=d[i])cnt[d[i]]++;
	rep(i, n)cnt[i + 2] += cnt[i];
	rep2(i, 1, n + 1) {
		cout << cnt[i] << endl;
	}
	return 0;
}