#include<bits/stdc++.h>
using namespace std;
long long n, m, e, h[1145141], ne[1145141], t[1145141], u, v, b[1145141], is[1145141], cnt, f[2][114514], c[1145141], d[1145141], cntt, cnttt;
map<long long, long long>ma;
int ct (int x, int y) {
	e++;
	ne[e] = h[x];
	h[x] = e;
	t[e] = y;
	return 0;
}
int dfs(int x, int y) {
	is[x] = 1;
	b[y]++;
	for (int i = h[x]; i; i = ne[i]) {
		if (!is[t[i]]) {
			dfs(t[i], y);
		}
	}
	return 0;
}
int main () {
	cin >> n >> m;
	for (int i = 1; i <= m; i++) {
		scanf("%lld %lld", &u, &v);
		ct(u, v);
		ct(v, u);
	}
	for (int i = 1; i <= n; i++) {
		if(!is[i]) {
			dfs(i, ++cnt);
		}
	}
	for (int i = 0; i <= 1; i++) {
		for (int j = 1; j <= n; j++) {
			f[i][j] = 11451419;
		}
	}
	for (int i = 1; i <= cnt; i++) {
		if (!ma[b[i]])
			d[++cntt] = b[i];
		ma[b[i]]++;
	}
	for (int i = 1; i <= cntt; i++) {
		int blg = 1;
//		while (ma[d[i]]) {
//			if (ma[d[i]] & 1) {
//				c[++cnttt] = blg * d[i];
//			}
//			blg *= 2;
//			ma[d[i]] >>= 1;
//		}
		while (ma[d[i]] > blg) {
			ma[d[i]] -= blg;
			c[++cnttt] = blg * d[i];
			blg *= 2;
		}
		c[++cnttt] = ma[d[i]] * d[i];
	}
	f[0][0] = 0;
	for (int i = 1; i <= cnttt; i++) {
		for (int j = n; j >= c[i]; j--) {
			f[i & 1][j] = min(f[(i - 1) & 1][j - c[i]] + 1, f[(i - 1) & 1][j]);
		}
		for (int j = c[i] - 1; j; j--) f[i & 1][j] = f[(i - 1) & 1][j];
		f[i & 1][c[i]] = 0;
	}
	for (int i = 1; i <= n; i++) {
		if (f[cnttt & 1][i] >= 11451419) cout << "-1\n";
		else
			cout << f[cnttt & 1][i] << "\n";
	}
}