#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <vector>
#define NMAX 200005
#define pb push_back
using namespace std;
int n,m,C[NMAX],r,sol[NMAX];
vector <int> A[NMAX],B[NMAX];
char marc[NMAX];
inline int non(int x)
{
	return x>n ? x-n : x+n;
}
void read()
{
	scanf("%d%d",&n,&m);
	int i,x,y;
	for (i=1; i<=m; i++)
	{
		scanf("%d%d",&x,&y);
		if (x<0) x=non(-x);
		if (y<0) y=non(-y);
		A[non(x)].pb(y); B[y].pb(non(x));
		A[non(y)].pb(x); B[x].pb(non(y));
	}
}
void dfs1(int nod)
{
	marc[nod]=1;
	int i,vec;
	for (i=0; i<A[nod].size(); i++)
	{
		vec=A[nod][i];
		if (!marc[vec])
			dfs1(vec);
	}
	C[++r]=nod;
}
void dfs2(int nod)
{
	if (sol[nod])
	{
		printf("-1\n");
		exit(0);
	}
	sol[non(nod)]=1;
	marc[nod]=1; 
	int i,vec;
	for (i=0; i<B[nod].size(); i++)
	{
		vec=B[nod][i];
		if (!marc[vec])
			dfs2(vec);
	}
}
void ctc()
{
	int i;
	for (i=1; i<=2*n; i++)
		if (!marc[i])
			dfs1(i);
	memset(marc,0,sizeof(marc));
	for (i=r; i>=1; i--)
		if (!marc[C[i]] && !marc[non(C[i])])
			dfs2(C[i]);
	for (i=1; i<=n; i++)
		printf("%d ",sol[i]);
	printf("\n");
}
int main()
{
	freopen("2sat.in","r",stdin);
	freopen("2sat.out","w",stdout);
	read();
	ctc();
	return 0;
}