#include<bits/stdc++.h>
using namespace std;
int fa[200005];
int find(int x)
{
	return fa[x]==x?x:fa[x]=find(fa[x]);
}
int siz[200005];
int dp[200005];
int cnt[200005];
int main()
{
	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	int n,m;
	cin>>n>>m;
	for(int i =1;i<=n;i++) fa[i]=i;
	for(int i =1;i<=m;i++)
	{
		int u,v;
		cin>>u>>v;
		fa[find(u)]=find(v);
	}
	for(int i =1;i<=n;i++)
	{
		siz[find(i)]++;
	}
	for(int i =1;i<=n;i++)
	{
		if(siz[i]) cnt[siz[i]]++;
	}
	memset(dp,0x7f,sizeof dp);
	dp[0]=0;
	for (int i =1;i<=n;i++) 
	{
    	for (int k=1;cnt[i];k*=2) 
		{
            int num=min(cnt[i],k);
            for (int j=n-num*i;j>=0;j--) 
			{
                int nj=j+num*i;
                dp[nj]=min(dp[nj],dp[j]+num);
            }
            cnt[i]-=num;
        }
    }
	for(int i =1;i<=n;i++)
	{
		if(dp[i]>2e9)
		{
			cout<<"-1\n";
		}
		else
		{
			cout<<dp[i]-1<<'\n';
		}
	}
	return 0;
}