#include<iostream>
#include<algorithm>
#include<deque>
using namespace std;

#define INF (1 << 29)

int dp[108000], dd[108000];
int mm, n, m, x, y;
int cnt[108000], res[108000];
int u[108000];

int r(int x){
	if(u[x] == x)return x;
	return u[x] = r(u[x]);
}

void unite(int x, int y){
//	if(r(x) == r(y))return;
	x = r(x);
	y = r(y);
	u[x] = y;
}

int main(){
	cin >> n >> m;
	for(int i = 1;i <= n;i++)u[i] = i;
	for(int i = 0;i < m;i++){
		cin >> x >> y;
		unite(x, y);
	}
	for(int i = 1;i <= n;i++){
		cnt[r(i)]++;
	}
	int pp = 0;
	for(int i = 1;i <= n;i++){
		if(cnt[i]){
			res[cnt[i]]++;
			pp++;
		}
	}
	fill(dp, dp + n + 3, INF);
	dp[0] = 0;
	for(int i = 1;i <= n;i++){
		if(res[i] == 0)continue;
		fill(dd, dd + n + 3, INF);
		int c = res[i], tmp = 0;
		for(int m = 0;m < i;m++){
			deque<int> dq;
			for(int j = 0;j*i+m <= n;j++){
				while(!dq.empty() && dp[dq.back() * i + m] - dq.back() >= dp[j*i+m]-j)dq.pop_back();
				dq.push_back(j);
				while(!dq.empty() && dq.front() < j - c)dq.pop_front();
				int ans = dq.front();
				
				if(dp[ans*i+m] == INF)dp[j*i+m] = INF;
				else dd[j * i + m] = dp[ans * i + m] + j - ans;
			}
		}
		for(int j = 0;j <= n;j++)dp[j] = min(INF, dd[j]);
	}                         
	for(int i = 1;i <= n;i++){
		if(dp[i] == INF)cout << -1 << endl;
		else cout << dp[i] - 1 << endl;
	}
	return 0;	
}