#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 <cassert>

int main(){
	int n,m;
	//cin >> n >> m;
	scanf("%d%d", &n, &m);
	UnionFindTree uft(n);

	for(int i=0; i<m; ++i){
		int u,v;
		scanf("%d%d", &u, &v);
		u--;v--;
		uft.unite(u,v);
	}

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

	vector<int> unko(n+1, 0);
	for(int i=0; i<n; ++i){
		if(cnt[i]) unko[cnt[i]] += 1;
	}

	const int inf = 5*n;
	vector<int> ans(n+1, inf);
	ans[0] =-1;

	for(int i=0; i<=n; ++i){
		for(int k=1; unko[i]; k<<=1){
			int c = min(unko[i], k);
			for(int p=n-c * i; p>=0; --p){
				if(ans[p] == inf) continue;
				if(ans[p + c * i] > ans[p] + c){
					ans[p+c * i] = ans[p] + c;
				}
			}
			unko[i] -= c;
		}
	}
	for(int i=1; i<=n; i++){
		if(ans[i] == inf) ans[i] = -1;
		printf("%d\n", ans[i]);
	}

	return 0;
}