#include <bits/stdc++.h>
using namespace std;
inline int read(){
	int x=0,f=1;
	char ch=getchar();
	while(ch<48||ch>57){
		if(ch==45)f=-1;
		ch=getchar();
	}
	while(ch>=48&&ch<=57)x=(x<<1)+(x<<3)+(ch^48),ch=getchar();
	return x*f;
}
const int N=1e5+3;
int n,m;
vector<int> e[N];
int cur[N],s[N],cnt,v[N],cnt_[N];
int ans[N];
inline void dfs(int u,int fa){
	cur[u]=cnt;
	++s[cnt];
	for(int v:e[u]){
		if(v==fa||cur[v])continue;
		dfs(v,u);
	}
}
signed main(){
	ios::sync_with_stdio(time(0));cin.tie(0),cout.tie(0);
	n=read(),m=read();
	for(int i=1,x,y;i<=m;++i){
		x=read(),y=read();
		e[x].emplace_back(y);
		e[y].emplace_back(x);
	}
	for(int i=1;i<=n;++i)if(!cur[i]){++cnt;dfs(i,0);}
//	cout<<1;
	for(int i=1;i<=n;++i)ans[i]=1e9;
	
	
	
	for(int i=1;i<=cnt;++i)ans[s[i]]=0,++cnt_[s[i]],v[i]=1;//cout<<i<<": "<<s[i]<<endl;
	
//	sort(s+1,s+1+cnt);
	
	for(int i=1;i<=cnt;++i){
		for(int j=n;j>=s[i];--j){
			if(j-s[i]==s[i]&&cnt_[s[i]]<=1)continue;
			ans[j]=min(ans[j],ans[j-s[i]]+v[i]);
		}
	}
	
	
	
	
	for(int i=1;i<=n;++i){
		if(ans[i]==1000000000)puts("-1");
		else cout<<ans[i]<<endl;
	}
	
	
	

	return 0;
}