#include <bits/stdc++.h>
#define rep(i,j,k) for(int i=(j);i<=(k);i++)
#define per(i,j,k) for(int i=(j);i>=(k);i--)
#define uint unsigned int
#define ll long long
#define ull unsigned long long
#define db double
#define ldb long double
#define pii pair<int,int>
#define pll pair<ll,ll>
#define mkp make_pair
#define eb emplace_back
#define SZ(S) (int)S.size()
//#define mod 998244353
//#define mod 1000000007
#define inf 0x3f3f3f3f
#define linf 0x3f3f3f3f3f3f3f3f
using namespace std;

template <class T>
void chkmax(T &x,T y){
	if(x < y) x = y;
}

template <class T>
void chkmin(T &x,T y){
	if(x > y) x = y;
}

inline int popcnt(int x){
	return __builtin_popcount(x);
}

inline int ctz(int x){
	return __builtin_ctz(x);
}


/*ll power(ll p,int k = mod - 2){
	ll ans = 1;
	while(k){
		if(k % 2 == 1) ans = ans * p % mod;
		p = p * p % mod;
		k /= 2;	
	}
	return ans;
}*/
int n,m;
int a[1005],b[1005],val[45],ans[45];

void dfs(int p){
	if(p == m + 1){
		int s = n,t = 1;
		rep(i,1,n){
			if(val[i] == 1){
				chkmin(s,i);
				chkmax(t,i);
			}
		}
		rep(i,1,s){
			rep(j,max(t,i),n){
				if(val[j] == 0) break;
				ans[j - i + 1] ^= 1;
			}
		}
		return;
	}
	int x = a[p],y = b[p];
	if(val[x] < 0 && val[y] < 0){
		val[x] = val[y] = 0;
		dfs(p + 1);
		val[x] = val[y] = 1;
		dfs(p + 1);
		val[x] = val[y] = -1;
	}else{
		if(!val[x]){
			dfs(p + 1);
		}else if(val[x] == 1){
			swap(val[x],val[y]);
			dfs(p + 1);
			swap(val[x],val[y]);
		}else if(val[y] == 1){
			dfs(p + 1);
		}else{
			assert(!val[y]);
			swap(val[x],val[y]);
			dfs(p + 1);
			swap(val[x],val[y]);			
		}
	}
}

int main(){
//	freopen("test.in","r",stdin);
	scanf("%d%d",&n,&m);
	rep(i,1,m) scanf("%d%d",&a[i],&b[i]);
	rep(i,1,n) val[i] = -1;
	dfs(1);
	rep(i,1,n) printf("%d ",ans[i]);
	printf("\n");
	return 0;
}