// Yukicoder 317
#include <algorithm>
#include <cstdio>
#include <numeric>

constexpr int N = 1e5 + 5, Inf = 0x3f3f3f3f;

int n, m, f[N], s[N], cnt[N], dp[N];

void init(int n) {
  std::iota(f + 1, f + n + 1, 1);
  std::fill(s + 1, s + n + 1, 1);
}

int find(int u) { return u == f[u] ? u : f[u] = find(f[u]); }

void merge(int u, int v) {
  int fu = find(u), fv = find(v);
  if (fu == fv) return;
  if (s[fu] < s[fv]) std::swap(fu, fv);
  f[fv] = fu;
  s[fu] += s[fv];
}

void update(int v, int w) {
  for (int vv = n; vv >= v; --vv) dp[vv] = std::min(dp[vv], dp[vv - v] + w);
}

int main() {
  scanf("%d %d", &n, &m);
  init(n);
  for (int i = 1; i <= m; ++i) {
    int u, v;
    scanf("%d %d", &u, &v);
    merge(u, v);
  }
  for (int i = 1; i <= n; ++i) {
    dp[i] = Inf;
    if (i == f[i]) ++cnt[s[i]];
  }
  for (int i = 1; i <= n; ++i)
    if (cnt[i]) {
      int b = 1;
      while (cnt[i] > b) {
        update(i * b, b);
        cnt[i] -= b;
        b <<= 1;
      }
      if (cnt[i]) update(i * cnt[i], cnt[i]);
    }
  for (int i = 1; i <= n; ++i) printf("%d\n", (dp[i] == Inf ? 0 : dp[i]) - 1);
}