#include <cstdio>
#include <algorithm>
#include <stack>
#include <queue>
#include <deque>
#include <vector>
#include <string>
#include <string.h>
#include <cstdlib>
#include <ctime>
#include <cmath>
#include <map>
#include <set>
#include <iostream>
#include <sstream>
#include <numeric>
#include <cctype>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < n; ++i)
#define rrep(i,n) for(int i = 1; i <= n; ++i)
#define drep(i,n) for(int i = n-1; i >= 0; --i)
#define gep(i,g,j) for(int i = g.head[j]; i != -1; i = g.e[i].next)
#define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define rng(a) a.begin(),a.end()
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y)
#define pb push_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcount
#define snuke srand((unsigned)clock()+(unsigned)time(NULL));
#define df(x) int x = in()
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
inline int in() { int x; scanf("%d",&x); return x;}
inline void priv(vi a) { rep(i,sz(a)) printf("%d%c",a[i],i==sz(a)-1?'\n':' ');}

const int MX = 200005, INF = 1000010000;
const ll LINF = 1000000000000000000ll;
const double eps = 1e-10;

int n, m;
// Union find
struct uf{
  vector<int> d;
  uf(){}
  uf(int mx):d(mx,-1){}
  int root(int x){
    if(d[x] < 0) return x;
    return d[x] = root(d[x]);
  }
  void unite(int x, int y){
    x = root(x); y = root(y);
    if(x == y) return;
    if(d[x] > d[y]) swap(x,y);
    d[x] += d[y]; d[y] = x;
  }
};
//

int ans[MX];
int cnt[MX];

int main() {
  scanf("%d%d",&n,&m);
  uf t(n);
  rep(i,m) {
    int a, b;
    scanf("%d%d",&a,&b);
    --a; --b;
    t.unite(a,b);
  }
  rep(i,n) if (t.root(i) == i) {
    cnt[-t.d[i]]++;
  }
  rep(i,n+1) ans[i] = INF;
  ans[0] = -1;
  int sum = 1;
  rrep(i,n) {
    if (cnt[i] == 0) continue;
    int nc = cnt[i];
    vi c;
    rep(j,20) {
      if (nc >= 1<<j) {
        c.pb(1<<j);
        nc -= 1<<j;
      }
    }
    if (nc) c.pb(nc);
    for (int x : c) {
      int xs = x*i;
      for (int j = sum; j >= 0; --j) {
        mins(ans[j+xs], ans[j]+x);
      }
      sum += xs;
    }
  }
  rrep(i,n) {
    if (ans[i] == INF) ans[i] = -1;
    printf("%d\n", ans[i]);
  }
  return 0;
}