#include <string>
#include <vector>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<stack>
#include<queue>
#include<cmath>
#include<algorithm>
#include<functional>
#include<list>
#include<deque>
#include<bitset>
#include<set>
#include<map>
#include<unordered_map>
#include<cstring>
#include<sstream>
#include<complex>
#include<iomanip>
#include<numeric>
#define X first
#define Y second
#define pb push_back
#define rep(X,Y) for (int (X) = 0;(X) < (Y);++(X))
#define rrep(X,Y) for (int (X) = (Y)-1;(X) >=0;--(X))
#define repe(X,Y) for ((X) = 0;(X) < (Y);++(X))
#define peat(X,Y) for (;(X) < (Y);++(X))
#define all(X) (X).begin(),(X).end()
#define rall(X) (X).rbegin(),(X).rend()
#define eb emplace_back
#define UNIQUE(X) (X).erase(unique(all(X)),(X).end())

using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
template<class T> using vv=vector<vector<T>>;
template<class T> ostream& operator<<(ostream &os, const vector<T> &t) {
os<<"{"; rep(i,t.size()) {os<<t[i]<<",";} os<<"}"<<endl; return os;}
template<class S, class T> ostream& operator<<(ostream &os, const pair<S,T> &t) { return os<<"("<<t.first<<","<<t.second<<")";}
const ll MOD=1e9+7;
struct UF{
  vector<int> data;
  UF(int size):data(size,-1){}
  bool unite(int x,int y){
    x=root(x); y=root(y);
    if(x!=y){
      if(data[y]<data[x]) swap(x,y);
      data[x]+=data[y]; data[y]=x;
    }
    return x!=y;
  }
  bool findSet(int x,int y){return root(x)==root(y);}
  int root(int x){return data[x]<0?x:data[x]=root(data[x]);}
  int size(int x) {return -data[root(x)];}
};
const int INF=1e7;
int main(){
  ios_base::sync_with_stdio(false);
  cout<<fixed<<setprecision(0);
  int n,m;
  cin>>n>>m;
  int x,y;
  UF uf(n);
  rep(i,m){
    cin>>x>>y; --x; --y;
    uf.unite(x,y);
  }
  vector<int> dp(312345,INF),cnt(n+1),pre;
  rep(i,n) if(uf.data[i]<0) ++cnt[-uf.data[i]];
  //cout<<cnt;
  dp[0]=0;
  rep(i,n+1) if(cnt[i]){
    pre=dp;
    rep(d,i){
      deque<pii> que;
      rep(j,n/i+1){
	while(que.size() && j-que.front().Y>cnt[i])
	  que.pop_front();
	while(que.size() && que.back().X+j-que.back().Y>=dp[j*i+d])
	  que.pop_back();
	que.eb(pre[j*i+d],j);
	if(que.size())
	  dp[j*i+d]=que.front().X+j-que.front().Y;
	//rep(k,que.size())cout<<que[i]<<",";cout<<endl;
      }
    }
    //cout<<i<<endl;
    //rep(i,30)cout<<dp[i]<<",";cout<<endl;
  }
  rep(i,n)
    cout<<(dp[i+1]>=INF?-1:dp[i+1]-1)<<endl;
  return 0;
}