#include<bits/stdc++.h>
#define ll long long
using namespace std;
ll read()
{
	ll s=0,p=1;
	char c;
	c=getchar();
	while((c>'9'||c<'0')&&c!='-')
	  c=getchar();
	if(c=='-')
	{
	  p=-1;
	  c=getchar();
	}
	while(c>='0'&&c<='9')
	{
		s=(s<<3)+(s<<1)+c-'0';
		c=getchar();
	}
	return s*p;
}
inline void write(ll x)
{
	if(x==0)
	  return;
	if(x<0)
	{
	  putchar('-');
	  write(-x);
	  return;
	}
	write(x/10);
	putchar(x%10+'0');
	return;
}
ll n,m,h[200000],f[200000],l,dfn[200000],mi,dp[200000];
struct bs{
	ll n,t;
}e[200000];
void cr(ll x,ll y)
{
	e[++l].t=y;
	e[l].n=h[x];
	h[x]=l;
}
void dfs(ll x,ll fa)
{
	dfn[x]=1;
	for(int i=h[x];i;i=e[i].n)
	  if(e[i].t!=fa&&e[i].t!=x&&!dfn[e[i].t])
	  {
	  	dfs(e[i].t,x);
	  	dfn[x]+=dfn[e[i].t];
	  } 
	return;
}
int main()
{
	ll x,y;
	n=read();m=read();
	while(m)
	{
	  m--;
	  x=read();y=read();
	  cr(x,y);
	  cr(y,x);
	}
	for(int i=1;i<=n;i++)
	{
	  dp[i]=n+1;
	  if(!dfn[i])
	  {
	  	dfs(i,-1);
	  	f[dfn[i]]++;
	  	mi=max(dfn[i],mi);
	  }
	}
	dp[0]=0;
	for(int i=1;i<=mi;i++)
	  for(int k=n;k>=0;k--)
	    for(int j=0;j<=f[i];j++)
          if(k>=j*i)
	        dp[k]=min(dp[k],dp[k-i*j]+j);
	for(int i=1;i<=n;i++)
	  if(dp[i]==n+1)
	  {
	  	write(-1);
	  	putchar('\n');
	  }
	  else
	  	printf("%lld\n",dp[i]-1);
	return 0;
}