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

struct dsu {
    public:
    int csz;
    dsu() : _n(0) {}
    dsu(int n) : _n(n), csz(n), parent_or_size(n, -1) {}

    int merge(int a, int b) {
        assert(0 <= a && a < _n);
        assert(0 <= b && b < _n);
        int x = leader(a), y = leader(b);
        if (x == y) return x;
        if (-parent_or_size[x] < -parent_or_size[y]) std::swap(x, y);
        csz--;
        parent_or_size[x] += parent_or_size[y];
        parent_or_size[y] = x;
        return x;
    }

    bool same(int a, int b) {
        assert(0 <= a && a < _n);
        assert(0 <= b && b < _n);
        return leader(a) == leader(b);
    }

    int leader(int a) {
        assert(0 <= a && a < _n);
        if (parent_or_size[a] < 0) return a;
        return parent_or_size[a] = leader(parent_or_size[a]);
    }

    int size(int a) {
        assert(0 <= a && a < _n);
        return -parent_or_size[leader(a)];
    }

    std::vector<std::vector<int>> groups() {
        std::vector<int> leader_buf(_n), group_size(_n);
        for (int i = 0; i < _n; i++) {
            leader_buf[i] = leader(i);
            group_size[leader_buf[i]]++;
        }
        std::vector<std::vector<int>> result(_n);
        for (int i = 0; i < _n; i++) {
            result[i].reserve(group_size[i]);
        }
        for (int i = 0; i < _n; i++) {
            result[leader_buf[i]].push_back(i);
        }
        result.erase(
            std::remove_if(result.begin(), result.end(),
                           [&](const std::vector<int>& v) { return v.empty(); }),
            result.end());
        return result;
    }

    private:
    int _n;
    // root node: -1 * component size
    // otherwise: parent
    std::vector<int> parent_or_size;
};

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n, m, u, v;
    cin >> n >> m;
    dsu uf(n);
    while(m--){
        cin >> u >> v;
        uf.merge(--u, --v);
    }
    auto G = uf.groups();
    vector<int> b;
    vector<pair<int,int>> a;
    b.reserve(G.size());
    a.reserve(G.size());
    for(auto &&vec : G) b.emplace_back(vec.size());
    sort(b.begin(), b.end());
    for(int i = 0; i < b.size(); ){
        int p = i;
        while(i < b.size() && b[i] == b[p]) i++;
        int v = i - p;
        for(int j = 0; v; j++){
            if(v >= (1 << j)){
                v -= 1 << j;
                a.emplace_back(b[p] * (1 << j), 1 << j);
            }else{
                a.emplace_back(b[p] * v, v);
                v = 0;
            }
        }
    }
    sort(a.begin(), a.end());
    vector<int> dp(n + 1, 1 << 30);
    dp[0] = 0;
    for(int i = 0, s = 0; i < a.size(); i++){
        int v, c;
        tie(v, c) = a[i];
        for(int j = s; j >= 1; j--){
            dp[j + v] = min(dp[j + v], dp[j] + c);
        }
        dp[v] = 0;
        s += v;
    }
    for(int i = 1; i <= n; i++) cout << (dp[i] >> 30 ? -1 : dp[i]) << '\n';
}