#include <iostream>
#include <stdio.h>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <algorithm>
#include <functional>
#include <cmath>
#include <string>

using namespace std;

typedef vector <int> VI;
typedef vector <VI> VVI;
typedef vector <string> VS;
typedef pair<int,int> PII;
typedef long long LL;
typedef vector <LL> VLL;
typedef unsigned long long ULL;
typedef pair <int, LL> PIL;
typedef vector <PIL> VPIL;

//#define each(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); i++)
//#define sort(c) sort((c).begin(),(c).end())

#define range(i,a,b) for(int i=(a); i < (b); i++)
#define rep(i,n) range(i,0,n)

int parent[100001];

int root(int x){
	if (x != parent[x]) x = root(parent[x]);
	return parent[x];
}
int main(){
	int N,M,C,u,v,c,w;
	map <int,int> conn_comp, comp_num;
	map <int,int> :: iterator mit;
	VI ans;
	cin >> N >> M;
	ans = VI(N+1,N); ans[0] = 0;
	rep(i,N) parent[i] = i;
	rep(i,M){
		cin >> u >> v;
		u = root(u-1); v = root(v-1);
		if (u!=v) parent[u] = v;
	}
	rep(i,N) conn_comp[root(i)]++;
	for (mit=conn_comp.begin();mit!=conn_comp.end();mit++) comp_num[mit->second]++;
	for (mit=comp_num.begin();mit!=comp_num.end();mit++){
		c = 1; w = mit->first; C = mit->second;
		while (c <= C){
			if ((c&C) != 0) for (int i = N; i >= w; i--) ans[i] = min(ans[i],ans[i-w]+c);
			c *= 2; w *= 2;
		}
	}
	rep(i,N) cout << (ans[i+1]==N ? -1 : ans[i+1]-1) << endl;
	return 0;
}