#include <bits/stdc++.h>
using namespace std;

/*^ debug  */

template <typename A, typename B> string to_string(pair<A, B> p);
template <typename A, typename B, typename C> string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D> string to_string(tuple<A, B, C, D> p);
string to_string(const string& s) { return '"' + s + '"'; }
string to_string(const char* s) { return to_string((string) s); }
string to_string(bool b) { return (b ? "true" : "false"); }
string to_string(vector<bool> v) {
  bool first = true;
  string res = "{";
  for (int i = 0; i < static_cast<int>(v.size()); i++) {
    if (!first) { res += ", "; }
    first = false;
    res += to_string(v[i]);
  }
  res += "}";
  return res;
}
template <size_t N>
string to_string(bitset<N> v) {
  string res = "";
  for (size_t i = 0; i < N; i++) { res += static_cast<char>('0' + v[i]); }
  return res;
}
template <typename A>
string to_string(A v) {
  bool first = true;
  string res = "{";
  for (const auto &x : v) {
    if (!first) { res += ", "; }
    first = false;
    res += to_string(x);
  }
  res += "}";
  return res;
}
template <typename A, typename B>
string to_string(pair<A, B> p) { return "(" + to_string(p.first) + ", " + to_string(p.second) + ")"; }
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) { return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ")"; }
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) { return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")"; }
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) { cerr << " " << to_string(H); debug_out(T...); }
#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

/*  debug $*/

/*^ vector extensions  */

template<typename T>
T concat(initializer_list<T> lists) {
  T a;
  for (auto &l : lists) a.insert(a.end(), l.begin(), l.end());
  return a;
}

template<typename T, size_t sz>
struct _Matrix_type { typedef vector<typename _Matrix_type<T, sz - 1>::type> type; };
template<typename T>
struct _Matrix_type<T, 1> { typedef T type; };
template<typename T>
struct _Matrix {
  static auto build(size_t s) { return vector<T>(s); }
  template<typename ...Args>
  static auto build(size_t f, Args... args) {
    return vector<typename _Matrix_type<T, 1 + sizeof...(args)>::type>(f, _Matrix<T>::build(args...));
  }
};
template<typename T, typename... Args>
auto buildMatrix(Args... args) { return _Matrix<T>::build(args...); }

/*  vector extensions $*/

/*^ generic definitions  */

template<typename F>
struct _RecurFun : F {
  _RecurFun(F&& f) : F(forward<F>(f)) {}
  template<typename... Args>
  decltype(auto) operator()(Args&&... args) const { return F::operator()(*this, forward<Args>(args)...); }
};
template<typename F>
decltype(auto) RecurFun(F&& f) { return _RecurFun<F> { forward<F>(f) }; }

/*  generic definitions $*/

struct DSU {
  vector<int> fa;
  vector<int> sz;

  DSU(int n) : fa(n), sz(n, 1) { iota(fa.begin(), fa.end(), 0); }

  int find(int x) { return fa[x] == x ? x : fa[x] = find(fa[x]); }

  bool unite(int x, int y) {
    int fx = find(x);
    int fy = find(y);
    if (fx == fy) return false;
    fa[fy] = fx;
    sz[fx] += sz[fy];
    return true;
  }
};

int main() {
  ios::sync_with_stdio(false);

  int N, M; { cin >> N >> M; }

  DSU dsu(N); {
    for (int i = 0; i < M; ++i) {
      int U, V; { cin >> U >> V; --U, --V; }
      dsu.unite(U, V);
    }
  }

  map<int, int> ccsize2cnt; {
    for (int u = 0; u < N; ++u) if (dsu.find(u) == u) {
      ccsize2cnt[dsu.sz[u]] += 1;
    }
  }

  vector<int> dp(N + 1, N + 1); {
    dp[0] = 0;
    for (auto [sz, cnt] : ccsize2cnt) {
      for (int r = 0; r < sz; ++r) {
        deque<pair<int, int>> dq;
        for (int i = r; i <= N; i += sz) {
          while (dq.size() && (i - dq.front().second) > sz * cnt) dq.pop_front();
          while (dq.size() && dq.back().first >= dp[i] - (i / sz + 1)) dq.pop_back();
          dq.emplace_back(dp[i] - (i / sz + 1), i);
          if (dq.front().second != i) {
            dp[i] = min(dp[i], dq.front().first + (i / sz + 1));
          }
        }
      }
    }
  }

  for (int i = 1; i <= N; ++i) {
    cout << (dp[i] > N ? -1 : dp[i] - 1) << "\n";
  }
}