#include<iostream>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<queue>
using std::cin;using std::cout;
constexpr int N=100005,M=200005;
int n,m,cnt,col[N],pre[N],u[N],v[N],fa[N];
struct A{int u,v;}g[M];
std::vector<A>edge[N];
struct B{int u,v,w;inline bool operator<(const B &a)const{return w<a.w;}};
std::priority_queue<B>q;
inline int find(int x){return fa[x]==x?x:fa[x]=find(fa[x]);}
signed main(){
//	freopen("cut.in","r",stdin);
//	freopen("cut.out","w",stdout);
	std::ios::sync_with_stdio(false);
	cin.tie(nullptr);cout.tie(nullptr);
	cin>>n>>m;for(int i=1;i<=n;++i) fa[i]=i;
	for(int i=1;i<=m;++i){cin>>g[i].u>>g[i].v;if(g[i].u>g[i].v) std::swap(g[i].u,g[i].v);fa[find(g[i].u)]=find(g[i].v);}
	std::sort(g+1,g+m+1,[](A a,A b){return a.u!=b.u?a.u<b.u:a.v<b.v;});
	for(int i=1;i<=m;++i){
		++cnt;
		if(g[i].u!=g[i+1].u||g[i].v!=g[i+1].v){
			edge[g[i].u].push_back(A{g[i].v,cnt});
			edge[g[i].v].push_back(A{g[i].u,cnt});
			int p=find(g[i].u);
			if(cnt>pre[p]){pre[p]=cnt;u[p]=g[i].u;v[p]=g[i].v;}
			cnt=0;
		}
	}
	// for(int i=1;i<=n;++i) std::cerr<<find(i)<<' '<<pre[i]<<' '<<u[i]<<' '<<v[i]<<'\n';
	for(int i=1;i<=n;++i)
		if(find(i)==i){
			col[u[i]]=1;col[v[i]]=2;
			for(A j:edge[u[i]]) if(!col[j.u]) q.push(B{u[i],j.u,j.v});
			for(A j:edge[v[i]]) if(!col[j.u]) q.push(B{v[i],j.u,j.v});
		}
	while(!q.empty()){
		B k=q.top();q.pop();
		// std::cerr<<k.v<<' '<<k.u<<'\n';
		if(col[k.v]) continue;
		col[k.v]=3-col[k.u];
		for(A i:edge[k.v]) if(!col[i.u]) q.push(B{k.v,i.u,i.v});
	}
	for(int i=1;i<=n;++i) cout<<std::max(0,col[i]-1)<<' ';
	return 0;cout<<"来海绘里香";
}//第三十九回 村姥姥是信口开河 情哥哥偏寻根究底
//来海绘里香