#include "bits/stdc++.h"
using namespace std;
#define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i))
#define rep(i,j) FOR(i,0,j)
#define each(x,y) for(auto &(x):(y))
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<(x)<<endl
#define smax(x,y) (x)=max((x),(y))
#define smin(x,y) (x)=min((x),(y))
#define MEM(x,y) memset((x),(y),sizeof (x))
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;

class UnionFind{
public:
    UnionFind(int _n):n(_n), cnt(_n), par(_n), rank(_n), size(_n, 1){
        for(int i=0;i<n;++i) par[i]=i;
    }
    int find(int k){
        return (k==par[k])?k:(par[k]=find(par[k]));
    }
    int operator[](int k){
        return find(k);
    }
    int getSize(int k){
        return size[find(k)];
    }
    void unite(int x, int y){
        x = find(x); y = find(y);
        if(x==y) return;
        --cnt;
        if(rank[x] < rank[y]){
            par[x] = y;
            size[y] += size[x];
        }else{
            par[y] = x;
            size[x] += size[y];
            if(rank[y] == rank[x]) ++rank[y];
        }
    }
    int count(){
        return cnt;
    }
private:
    int n, cnt;
    vector<int> par, rank, size;
};

const int INF = INT_MAX / 100;
int dp[2][100001];

int main(){
    int N, M;
    while(cin >> N >> M){
        UnionFind uft(N + 1);
        rep(i, M){
            int u, v;
            scanf("%d%d", &u, &v);
            uft.unite(u, v);
        }

        vi cnt(N + 1);
        FOR(i, 1, N + 1)cnt[uft[i]]++;
        map<int, int> cc;
        FOR(i, 1, N + 1)if(cnt[i])cc[cnt[i]]++;
        rep(i, N + 1)dp[0][i] = INF;
        dp[0][0] = -1;
        int cur = 0, nex = 1;
        each(p, cc){
            int a, b;
            tie(a, b) = p;
            memcpy(dp[nex], dp[cur], sizeof dp[cur]);
            rep(c, a){
                deque<pii> dq;
                for(int k = 0; c + k*a <= N; ++k){
                    if(sz(dq))smin(dp[nex][c + k*a], dq[0].second + k);
                    int val = dp[cur][c + k*a] - k;
                    while(sz(dq) && dq.back().second > val)dq.pop_back();
                    dq.emplace_back(k, val);
                    if(dq[0].first == k - b)dq.pop_front();
                }
            }
            swap(nex, cur);
        }
        FOR(i, 1, N+1)
            printf("%d\n", dp[cur][i] < INF ? dp[cur][i] : -1);
    }
}