#include<bits/stdc++.h>
#define pb push_back	
#define maxn 200005
using namespace std;
stack <int> q;
vector<int> v[maxn],aux;
vector<vector<int> > ctc;
int n,m,x,y,lowlink[maxn],indecs[maxn],onstack[maxn],verify[maxn],sol[maxn],i,nr=0;

int change_negative(int x){return (x<0)? abs(x):n+x;}
int change(int x){return (x<0)? (abs(x)+n):x;}
int check(int x){return (x>n)? (x-n): x;}


void graf(){
	while(m--){
		cin>>x>>y;
		v[change_negative(x)].push_back(change(y));
		v[change_negative(y)].push_back(change(x));
	}
}

void tarjan(int nod){
	indecs[nod]=lowlink[nod]=++i;	
	onstack[nod]=1; q.push(nod);
	for(auto it=v[nod].begin(); it!=v[nod].end(); it++){
		if(!indecs[*it]){
			tarjan(*it);
			lowlink[nod]=min(lowlink[nod],lowlink[*it]);
		}else if(onstack[*it])	
			lowlink[nod]=min(lowlink[nod],lowlink[*it]);
	}
	
	if(lowlink[nod]==indecs[nod]){
		nr++; aux.clear();		
		do{
			x=q.top();
			q.pop();
			onstack[x]=0;
			aux.pb(x);	
			verify[x]=nr;
		}while(x!=nod);
		ctc.pb(aux);
	}
}


int main(){
	freopen("2sat.in","r",stdin);
	freopen("2sat.out", "w",stdout);
	cin>>n>>m;
	graf();
	for(int i=1; i<=2*n; i++)
		if(indecs[i]==0)
			tarjan(i);
	for(int i=1; i<=n; i++)
		if(verify[i]==verify[i+n]){
			cout<<-1;
			return 0;
		}
	memset(sol, -1, sizeof(sol));
	for(int i=nr-1; i>=0; i--)
		for(auto it=ctc[i].begin(); it!=ctc[i].end(); it++)
			if(sol[check(*it)]==-1)
				sol[check(*it)]=(*it>n)? 1:0;
	for(int i=1; i<=n; i++)
		cout<<sol[i]<<' ';
}