#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n, m, e[400002], h[100002], ne[400002], idx, dp[100002], cnt[100002], az[1002], l, ans;
bool f[100002];
void add(ll x, ll y) {
	e[++ idx] = y, ne[idx] = h[x], h[x] = idx;
}
void dfs(ll x) {
	ans ++;
	f[x] = 1;
	for (ll i = h[x]; i; i = ne[i]) {
		ll y = e[i];
		if (! f[y]) dfs(y);
	}
}
int main() {
	cin >> n >> m;
	for (ll x, y; m --; ) cin >> x >> y, add(x, y), add(y, x);
	for (ll i = 1; i <= n; i ++ ) if (! f[i]) ans = 0, dfs(i), cnt[ans] ++;
	for (ll i = 1; i <= n; i ++ ) {
		if (! cnt[i]) continue;
		ll p = 1;
		while (p <= cnt[i]) {
			if (cnt[i] % (p << 1)) az[++ l] = p * i, cnt[i] -= p;
			p <<= 1;
		}
		if (cnt[i]) az[++ l] = cnt[i] * i;
	}
	memset(dp, 0x3f, sizeof dp);
	dp[0] = 0;
	for (ll i = 1; i <= n; i ++ ) for (ll j = n; j >= az[i]; j -- ) dp[j] = min(dp[j], dp[j - az[i]] + 1);
	for (ll i = 1; i <= n; i ++ ) cout << (dp[i] >= n ? -1ll : dp[i] - 1) << endl;
}