#include <stdio.h>
#include <stdlib.h>
#include <vector>
#include <bitset>
#include <algorithm>
#define LMAX 200005
#define pb push_back
using namespace std;
int n,m,A[LMAX],r;
vector <int> G[LMAX],GT[LMAX];
bitset <LMAX> viz;
char val[LMAX];
inline int non(int x)
{
	return x<=n ? x+n : x-n;
}
void dfs1(int nod)
{
	viz[nod]=1;
	int i,vec;
	for (i=0; i<G[nod].size(); i++)
	{
		vec=G[nod][i];
		if (!viz[vec])
			dfs1(vec);
	}
	A[++r]=nod;
}
void dfs2(int nod)
{
	if (val[nod])
	{
		printf("-1\n");
		exit(0);
	}
	viz[nod]=1; val[non(nod)]=1;
	int i,vec;
	for (i=0; i<GT[nod].size(); i++)
	{
		vec=GT[nod][i];
		if (!viz[vec])
			dfs2(vec);
	}
}
int main()
{
	freopen("2sat.in","r",stdin);
	freopen("2sat.out","w",stdout);
	scanf("%d%d",&n,&m);
	int i,a,b;
	for (i=1; i<=m; i++)
	{
		scanf("%d%d",&a,&b);
		if (a<0) a=non(-a);
		if (b<0) b=non(-b);
		G[non(a)].pb(b); GT[b].pb(non(a));
		G[non(b)].pb(a); GT[a].pb(non(b));
	}
	for (i=1; i<=2*n; i++)
		if (!viz[i])
			dfs1(i);
		
	viz.reset();
	for (i=r; i>=1; i--)
		if (!viz[A[i]] && !viz[non(A[i])])
			dfs2(A[i]);
		
	for (i=1; i<=n; i++)
		printf("%d ",val[i]);
	printf("\n");
	return 0;
}