#include <bits/stdc++.h>
using namespace std;

vector<int> e[100009];
queue<int> q;
bool vis[100009];

int cnt[100009];
int dp[100009];

int main(){
	memset(dp, 0x3f, sizeof dp);
	dp[0]=0;
	
	int n, m;
	scanf("%d%d", &n, &m);
	for (int i=1; i<=m; i++){
		int u, v;
		scanf("%d%d", &u, &v);
		e[u].push_back(v);
		e[v].push_back(u);
	}
	
	for (int i=1; i<=n; i++){
		if (vis[i])	continue;
		
		int num=0;
		q.push(i);
		while (q.size()){
			int x=q.front(); q.pop();
			if (vis[x])	continue;
			vis[x]=1; num++;
			for (int j=0; j<e[x].size(); j++){
				int y=e[x][j];
				if (!vis[y])	q.push(y);
			}
		}
		cnt[num]++;
	}
	
	for (int i=1; i<=n; i++) // \sqrt(n)
		for (int j=17; j>=0; j--){ // log(n)
			if (cnt[i]>=(1<<j)){ // ??? 
				cnt[i]-=(1<<j);
				for (int k=n-(1<<j)*i+1; k>=0; k--)
					dp[k+(1<<j)*i]=min(dp[k+(1<<j)*i], dp[k]+(1<<j));
			}
		}
	
	for (int i=1; i<=n; i++)
		if (dp[i]<1e9)
			printf("%d\n", dp[i]-1);
		else
			printf("-1\n");
	return 0;
}