#include <bits/stdc++.h>
using namespace std;

#define Nmax 100010
bool used[Nmax];
list<int> edges[Nmax];
int cs[Nmax];
int dp[Nmax];

int countf(int i){
	if(used[i]) return 0;
	used[i]=true;
	int result = 1;
	for(auto it=edges[i].begin(); it!=edges[i].end(); ++it){
		result += countf(*it);
	}
	return result;
}

int main(){
	int N,M;
	cin>>N>>M;

	for(int j=0;j<M;++j){
		int u,v;
		cin>>u>>v;
		edges[u].push_back(v);
		edges[v].push_back(u);
	}
	
	dp[0]=-1;
	for(int k=1;k<=N;++k){
		dp[k]=N;
	}

	for(int i=1;i<=N;++i){
		int c = countf(i);
		++cs[c];
		int d=c;
		while(cs[d]>2){
			cs[d]-=2;
			d*=2;
			cs[d]+=1;
		}
	}

	int sum=0;
	for(int c=1;c<=N;++c){
		for(int d=0;d<cs[c];++d){
			sum+=c;
			for(int k=sum-c;k>=0;--k){
				if(dp[k+c]>1+dp[k]){
					dp[k+c]=1+dp[k];
				}
			}
		}
	}

	for(int k=1;k<=N;++k){
		cout << (dp[k]<N?dp[k]:-1) << endl;
	}
}