#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define il inline
#define N 200005
il ll rd(){
	ll s = 0, w = 1;
	char ch = getchar();
	for (;ch < '0' || ch > '9'; ch = getchar()) if (ch == '-') w = -1;
	for (;ch >= '0' && ch <= '9'; ch = getchar()) s = ((s << 1) + (s << 3) + ch - '0');
	return s * w;
}
ll n, m, fa[N], sz[N], w[N * 50], v[N * 50], cnt, t[N], f[N * 50];
il ll find(ll x){return x == fa[x] ? x : fa[x] = find(fa[x]);}
const ll inf = 1e18;
void wt(ll x){
	if (x == -1) putchar('-'), putchar('1');
	else if (x == 0) putchar('0');
	else{
		int st[10], t;
		while (x) st[++t] = x % 10, x /= 10;
		while (t) putchar(st[t] + '0'), t--;
	}
	putchar('\n');
}
int main(){
	n = rd(), m = rd();
	for (int i = 1; i <= n; i++) fa[i] = i;
	for (int i = 1; i <= m; i++) fa[find(rd())] = find(rd());
	for (int i = 1; i <= n; i++) sz[find(i)]++;
	for (int i = 1; i <= n; i++) if (fa[i] == i) t[sz[i]]++;
	for (int i = 1; i <= n; i++){
//		cout << t[i] << "A\n";
		for (int j = 1; t[i] >= j; j <<= 1) t[i] -= j, w[++cnt] = j * i, v[cnt] = j;
		w[++cnt] = i * t[i], v[cnt] = t[i];
	}
	for (int i = 1; i <= n; i++) f[i] = inf;
	for (int i = 1; i <= cnt; i++)
		for (int j = n; j >= w[i]; j--)
			f[j] = min(f[j], f[j - w[i]] + v[i]);
	for (int i = 1; i <= n; i++) wt(f[i] % inf - 1);
	return 0;
}