#include<bits/stdc++.h>
#define Add(x,y) (x+y>=mod)?(x+y-mod):(x+y)
#define lowbit(x) x&(-x)
#define pi pair<ll,ll>
#define pii pair<ll,pair<ll,ll>>
#define iip pair<pair<ll,ll>,ll>
#define ppii pair<pair<ll,ll>,pair<ll,ll>>
#define fi first
#define se second
#define full(l,r,x) for(auto it=l;it!=r;it++) (*it)=x
#define Full(a) memset(a,0,sizeof(a))
#define open(s1,s2) freopen(s1,"r",stdin),freopen(s2,"w",stdout);
#define For(i,l,r) for(register int i=l;i<=r;i++)
#define _For(i,l,r) for(register int i=r;i>=l;i--)
using namespace std;
typedef double db;
typedef unsigned long long ull;
typedef long long ll;
bool Begin;
const ll N=1e5+10,INF=1e9+10;
inline ll read(){
    ll x=0,f=1;
    char c=getchar();
    while(c<'0'||c>'9'){
        if(c=='-')
          f=-1;
        c=getchar();
    }
    while(c>='0'&&c<='9'){
        x=(x<<1)+(x<<3)+(c^48);
        c=getchar();
    }
    return x*f;
}
inline void write(ll x){
	if(x<0){
		putchar('-');
		x=-x;
	}
	if(x>9)
	  write(x/10);
	putchar(x%10+'0');
}
ll n,m,x,y,a,s,k,cnt;
ll p[N],fa[N],siz[N],ans[N],v[N],w[N],dp[N];
ll Find(ll x){
	if(x!=fa[x])
	  return fa[x]=Find(fa[x]);
	return fa[x];
}
void merge(ll x,ll y){
	x=Find(x),y=Find(y);
	if(x==y)
	  return ;
	fa[x]=y;
}
void get(ll w,ll v){
	_For(i,w,n)
	  dp[i]=min(dp[i],dp[i-w]+v);
}
bool End;
int main(){
	n=read(),m=read();
	For(i,1,n){
		dp[i]=INF;
		fa[i]=i;
	}
	while(m--){
		x=read(),y=read();
		merge(x,y);
	}
	For(i,1,n)
	  siz[Find(i)]++;
	For(i,1,n)
	  p[siz[i]]++;
	For(i,1,n){
		if(!p[i])
		  continue;
		For(j,0,20){
		    if((1<<j)<=p[i]){
		    	get(i<<j,1<<j);
				p[i]-=(1<<j);
			}
		}
		if(p[i])
		  get(p[i]*i,p[i]);
	}
	For(i,1,n){
		if(dp[i]==INF)
		  puts("-1");
		else{
			write(dp[i]-1);
			putchar('\n');
		}
	}
	cerr<<'\n'<<abs(&Begin-&End)/1048576<<"MB";
	return 0;
}