#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<iomanip>
#include<cstring>
#include<queue>
#include<ctime>
#include<cstdlib>
using namespace std;
inline int read(){
	int x=0,f=1;char ch=getchar();
	while(ch<'0' || ch>'9')	{if(ch=='-'){f=-1;}ch=getchar();}
	while(ch>='0' && ch<='9')	{x=(x<<1)+(x<<3)+ch-'0';ch=getchar();}
	return x*f;
}
int n=0,m=0;
int a[100010]={},b[100010]={};
bool f[100010]={},flag=false;
int j(int x){
	if(x<0)	return -x;
	return x;
}
void init(){
	n=read();m=read();
	for(int i=1;i<=m;i++)	{a[i]=read();b[i]=read();}
}
void dfs(int k){
	if(flag)	return ;
	if(k==n+1)
	{
		bool ff=true;
		for(int i=1;i<=m;i++){
			if(((a[i]<0 && f[j(a[i])])||(a[i]>0 && !f[a[i]]))&&((b[i]<0 && f[j(b[i])])||(b[i]>0 && !f[b[i]])))	{ff=false;break;}
		}
		if(ff)	flag=true;
		return ;
	}
	if(!flag)	{f[k]=true;dfs(k+1);}
	if(!flag)	{f[k]=false;dfs(k+1);}
}
int main(){
	freopen("asm_report.in","r",stdin);
	freopen("asm_report.out","w",stdout);
	
	init();
	dfs(1);
	for(int i=1;i<=n;i++)
		cout<<f[i]<<' ';
	cout<<endl;
	
	fclose(stdin);fclose(stdout);
	return 0;
}