#include <vector>
#include <unordered_map>
#include <algorithm>
#include <cstdio>
using namespace std;
class union_find{
	int *parent,*rank,n;
public:
	int root(int a){return parent[a]==a?a:(parent[a]=root(parent[a]));}
	union_find(int _n){n=_n;parent=new int[n];rank=new int[n];for(int i=0;i<n;i++)parent[i]=i,rank[i]=0;}
	~union_find(){delete []parent;delete []rank;}
	void unite(int a,int b){
		int x=root(a),y=root(b);
		if(rank[x]<rank[y]){
			parent[x]=y;
		}else{
			parent[y]=x;
			if(rank[x]==rank[y])rank[x]++;
		}
	}
	void enumerate(unordered_map<int,int> &edges){
		unordered_map<int,int> r;
		for(int i=0;i<n;i++)++r[root(i)];
		for(auto &e:r)edges[e.second]++;
	}
};
int main(){
	const int INF=1<<29;
	int N,M;
	scanf("%d%d",&N,&M);
	union_find uf(N);
	for(;M--;){
		int a,b;
		scanf("%d%d",&a,&b);
		uf.unite(a-1,b-1);
	}
	unordered_map<int,int>edges;
	uf.enumerate(edges);
	vector<int>bag(N+1,INF);
	bag[0]=-1;
#if 0
	int t=0,tbelow,prev=0;
	for(auto &e:edges){
		int s=e.second;
		int d=1;
		while(s){
			int x=d;
			if(x>s)x=s;
			s-=x;
			int y=e.first*x;
			t+=y;
			for(int i=t;i>=y&&bag[i];i--)if(bag[i-y]<INF){
				bag[i]=min(bag[i],bag[i-y]+x);
			}
			d*=2;
		}
	/*
		if(prev!=e)prev=e,tbelow=e;
		else tbelow+=e;
		t+=e;
		for(int i=t;i>=tbelow&&bag[i];i--)if(bag[i-e]<INF){
			bag[i]=min(bag[i],bag[i-e]+1);
		}
	*/
	}
#endif
  int sum=0;
    for(auto &c:edges){
        int s=c.second;
        int d=1;
        while(s){
            int e=d;
            if(e>s)e=s;
            s-=e;
            int ce=c.first*e;
            sum+=ce;
            for(int k=sum-ce;k>=0;--k){
                if(bag[k+ce]>e+bag[k]){
                    bag[k+ce]=e+bag[k];
                }
            }
            d*=2;
        }
    }
	for(int i=1;i<=N;i++)printf("%d\n",bag[i]==INF ? -1 : bag[i]);
}