#include <iostream>
#include <vector>
#include <cstdio>
#include <sstream>
#include <map>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>
#include <set>
using namespace std;

class UnionFindTree{
	typedef struct {
		int parent;
		int rank;
	}base_node;
	
	vector<base_node> node;
public:
	UnionFindTree(int n){
		node.resize(n);
		for(int i=0; i<n; i++){
			node[i].parent=i;
			node[i].rank=0;
		}
	}

	int find(int x){
		if(node[x].parent == x) return x;
		else{
			return node[x].parent = find(node[x].parent);
		}
	}
	
	bool same(int x, int y){
		return find(x) == find(y);
	}

	void unite(int x, int y){
		x = find(node[x].parent);
		y = find(node[y].parent);
		if(x==y) return;
		if(node[x].rank < node[y].rank){
			node[x].parent = y;
		}else if(node[x].rank > node[y].rank){
			node[y].parent = x;
		}else{
			node[x].rank++;
			unite(x,y);
		}
	}
};

#include <bitset>
typedef bitset<100000> bits;
#include <cassert>

int main(){
	int n,m;
	cin >> n >> m;
	vector<vector<int>> g(n);

	UnionFindTree uft(n);

	for(int i=0; i<m; i++){
		int u,v;
		scanf("%d%d", &u, &v);
		u--;v--;
		g[u].push_back(v);
		g[v].push_back(u);

		uft.unite(u,v);
	}

	vector<int> cnt(n, 0);
	for(int i=0; i<n; i++){
		int r = uft.find(i);
		cnt[r]++;
	}

	//map<int,int> w;
	vector<int> unko;
	for(int i=0; i<n; i++){
		//if(cnt[i]) w[cnt[i]] += 1;
		if(cnt[i]) unko.push_back(cnt[i]);
	}
	sort(unko.begin(), unko.end());

	assert(unko.size() <= 20000);

	vector<bits> x(unko.size());
	for(int i=0; i<unko.size(); i++){
		for(int k=i; k>0; k--){
			x[k] |= x[k-1]<<unko[i];
		}
		x[0].set(unko[i]);
	}
	for(int i=1; i<unko.size(); i++){
		x[i] |= x[i-1];
	}

	vector<int> ans(n+1, -1);
	for(int i=1; i<=n; i++){
		auto check = [&](int pos){
			return x[pos][i];
		};
		long long lb = -1;
		long long ub = unko.size()-1;
		while(ub-lb>1){
			long long mid = (lb+ub)/2;
			bool ok = check(mid);
			(ok? ub : lb) = mid;
		}
		/*
		if(check[ub]){
			ans[i] = ub;
		}
		*/
		printf("%d\n", check(ub)?ub:-1);
	}

	return 0;
}