#include <cstdio>
#include <vector>
#include <algorithm>

using namespace std;

#define file_in "2sat.in"
#define file_out "2sat.out"

#define Nmax 201001

int viz[Nmax],n,m,nr;
int a,b;
int ok,sol[Nmax];
int ord[Nmax];
vector<int> G[Nmax];
vector<int> Gt[Nmax];

inline int neg (int a) { return a>n?a-n:a+n; }

void dfs(int nod)
{
	int i;
	if (viz[nod])
		return ;
	viz[nod]=1;
	for (i=0;i<G[nod].size();++i)
		 if (!viz[G[nod][i]])
			 dfs(G[nod][i]);
	ord[++nr]=nod;
}

void dfst(int nod)
{
	int i;
	if (viz[nod])
		return ;
	viz[nod]=1;
	if (sol[nod]) ok=0;
	sol[neg(nod)]=1;
	for (i=0;i<Gt[nod].size();++i)
		 if (!viz[Gt[nod][i]])
			 dfst(Gt[nod][i]);
}



int main()
{
	int i,a,b;
	freopen(file_in,"r",stdin);
	freopen(file_out,"w",stdout);
	
	scanf("%d %d", &n, &m);
	while(m--)
	{
		scanf("%d %d", &a, &b);
		if (a<0)
			a=-a+n;
		if (b<0)
			b=-b+n;
	    G[neg(a)].push_back(b);
	    G[neg(b)].push_back(a);
	    Gt[b].push_back(neg(a)); 
	    Gt[a].push_back(neg(b)); 
	}
	
	ok=1;
	nr=0;
	for (i=1;i<=2*n;++i)
		 if (!viz[i])
			 dfs(i);
	memset(viz,0,sizeof(viz));

	
	for (i=2*n;i>=1;--i)
		 if (!viz[ord[i]] && !viz[neg(ord[i])])
			 dfst(ord[i]);
		 
	if (ok)
		for (i=1;i<=n;++i)
		     printf("%d ", sol[i]);
	else
		printf("-1");

	fclose(stdin);
	fclose(stdout);
	
	return 0;
	
}