#include <bits/stdc++.h>

using namespace std;

vector<int> g[200010],gt[200010];
int q[200010],n,nr=0,bun=1;
char vaz[200010],sol[200010];

int non(int x)
{
    if(x<=n) return x+n;
    else return x-n;
}

void add_edge(int x,int y)
{
    g[x].push_back(y);
    gt[y].push_back(x);
}

void dfs1(int nod)
{
    vaz[nod]=1;
    for(vector<int>::iterator it=g[nod].begin();it!=g[nod].end();it++)
        if(!vaz[*it]) dfs1(*it);
    q[++nr]=nod;
}

void dfs2(int nod)
{
    if(sol[nod]) bun=0;
    vaz[nod]=sol[nod]=0;
    sol[non(nod)]=1;
    for(vector<int>::iterator it=gt[nod].begin();it!=gt[nod].end();it++)
        if(vaz[*it]) dfs2(*it);
}

int main()
{
    freopen("2sat.in", "r" ,stdin);
    freopen("2sat.out", "w", stdout);
    int m,x,y;
    scanf("%d%d",&n,&m);
    for(int i=1;i<=m;i++)
    {
        scanf("%d%d",&x,&y);
        if(x<0) x=-x+n;
        if(y<0) y=-y+n;
        add_edge(non(x),y);
        add_edge(non(y),x);
    }
    for(int i=1;i<=2*n;i++)
        if(!vaz[i]) dfs1(i);
    for(int i=nr;i;i--)
        if(vaz[q[i]] && vaz[non(q[i])]) dfs2(q[i]);
    if(!bun) printf("-1");
    else for(int i=1;i<=n;i++) printf("%d ",sol[i]);
    return 0;
}