#include <vector>
#include <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;}
	int same(int a,int b){return root(a)==root(b);}
	int unite(int a,int b){
		int x=root(a),y=root(b);if(x==y)return 0;
		if(rank[x]<rank[y]){
			parent[x]=y;
		}else{
			parent[y]=x;
			if(rank[x]==rank[y])rank[x]++;
		}
		return 1;
	}
	void enumerate(vector<int> &edges){
		map<int,int> r;
		for(int i=0;i<n;i++)r[root(i)]++;
		for(auto &e:r)edges.push_back(e.second);
		sort(edges.begin(),edges.end());
	}
};
int main(){
	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);
	}
	vector<int>edges;
	uf.enumerate(edges);
	vector<int>bag(N+1,-1);
	int t=0,prev=0;
	for(auto &e:edges){
		t+=e;
		for(int i=t;i>=e;i--)if(i==e||bag[i-e]>=0){
			if(bag[i]<0||bag[i]>bag[i-e]+1)bag[i]=bag[i-e]+1;
		}
	}
	for(int i=1;i<=N;i++)printf("%d\n",bag[i]);
}