#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];
vector<int> bag;
int main()
{
	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]) bag.push_back(siz[i]);
	}
	memset(dp,0x7f,sizeof dp);
	dp[0]=0;
	for(int i =0;i<bag.size();i++)
	{
		for(int j=n;j>=bag[i];j--)
		{
			dp[j]=min(dp[j-bag[i]]+1,dp[j]);
		}
	}
	for(int i =1;i<=n;i++)
	{
		if(dp[i]>2e9)
		{
			cout<<"-1\n";
		}
		else
		{
			cout<<dp[i]-1<<'\n';
		}
	}
	return 0;
}