#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef complex<double> P;
typedef pair<int,int> pii;
#define REP(i,n) for(ll i=0;i<n;++i)
#define REPR(i,n) for(ll i=1;i<n;++i)
#define FOR(i,a,b) for(ll i=a;i<b;++i)

#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define DEBUG_VEC(v) cout<<#v<<":";REP(i,v.size())cout<<" "<<v[i];cout<<endl
#define ALL(a) (a).begin(),(a).end()

#define MOD (ll)(1e9+7)
#define ADD(a,b) a=((a)+(b))%MOD
#define FIX(a) ((a)%MOD+MOD)%MOD

struct UF{
  vi data;
  UF(int size):data(size,-1){}
  int root(int a){
    return data[a]<0 ? a : data[a]=root(data[a]);
  }
  void unite(int a,int b){
    a=root(a);
    b=root(b);
    if(a!=b){
      if(data[b]<data[a])swap(a,b);
      data[a] += data[b];
      data[b] = a;
    }
  }
  bool same(int a,int b){
    return root(a) == root(b);
  }
  int size(int a){
    return -data[root(a)];
  }
};

int main(){
  ll n,m;
  cin >> n >> m;
  UF uf(n);
  REP(i,m){
    int u,v;
    cin>>u>>v;
    --u;--v;
    uf.unite(u,v);
  }
  map<ll,ll> szs;
  REP(i,n){
    if(uf.root(i)==i) szs[uf.size(i)]+=1; // szs.push_back(uf.size(i));
  }
  map<ll,ll> dp;
  map<ll,ll>::iterator iter;
  dp[0] = -1;
  map<ll,ll>::iterator iter2;
  iter2 = szs.begin();
  while(iter2!=szs.end()){
    ll num = iter2->first;
    ll cnt = iter2->second;
    ++iter2;
    iter = dp.end();
    while(iter!=dp.begin()){
      --iter;
      ll id = iter->first;
      ll val = iter->second;
      REP(i,cnt){
        id += num;
        if(id>n)break;
        if(dp.count(id)) dp[id]=min(dp[id],val+1);
        else             dp[id]=val+1;
      }
      // if(id+szs[i]<=n){
      //   if(dp.count(id+szs[i]) == 1)
      //     dp[id+szs[i]] = min(dp[id+szs[i]],val+1);
      //   else
      //     dp[id+szs[i]] = val+1;
      // }
    }
  }
  REPR(i,n+1){
    if(dp.count(i) == 1){
      cout << dp[i] << endl;
    }else{
      cout << -1 << endl;
    }
  }
  return 0;
}