#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 15;
int n, p[N], sz[N], m;
int find(int x) { return (p[x] == x) ? x : p[x] = find(p[x]); }
int cnt[N]; //cnt[i]  ---->   w:i, v:1
bool st[N];
int dp[N];

int main() {
    scanf("%d%d", &n, &m);
    for (int i = 1; i <= n; i++) p[i] = i, sz[i] = 1;
    for (int i = 1; i <= m; i++) {
        int u, v; scanf("%d%d", &u, &v);
        u = find(u), v = find(v);
        if (u == v) continue;
        if (sz[u] > sz[v]) swap(u, v);
        p[u] = v, sz[v] += sz[u];
    }
    for (int i = 1; i <= n; i++) {
        int x = find(i);
        if (st[x]) continue;
        st[x] = 1;
        cnt[sz[x]]++;
    }
    // for (int i = 1; i <= n; i++) cout << cnt[i] << ' '; puts("");
    memset(dp, 0x3f, sizeof dp);
    dp[0] = 0;
    for (int i = 1; i <= n; i++) {
        int w = i, s = cnt[i];
        if (!s) continue;
        for (int k = 1; k <= s; k <<= 1) {
            for (int j = n; j >= k * w; j--) {
                dp[j] = min(dp[j], dp[j - k * w] + k);
                // if (j == n) cout << '\t' << j - k * w << ' ' << dp[j - k * w] + k << endl;
            }
            s -= k;
        }
        if (s)
            for (int j = n; j >= s * w; j--) dp[j] = min(dp[j], dp[j - s * w] + s);
    }
    for (int i = 1; i <= n; i++) {
        if (dp[i] == 0x3f3f3f3f) puts("-1");
        else printf("%d\n", dp[i] - 1);
    }
    return 0;
}