#include <bits/stdc++.h>

using namespace std;

char vaz[200010];
int q[200010],l,ans[200010],ok=1,n;
vector<int> v[200010],vt[200010];

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

void dfs(int nod)
{
    vaz[nod]=1;
    for(int i=0;i<v[nod].size();i++)
        if(!vaz[v[nod][i]]) dfs(v[nod][i]);
    q[++l]=nod;
}

void dfs1(int nod)
{
    if(ans[nod]) ok=0;
    vaz[nod]=0;
    ans[non(nod)]=1;
    for(int i=0;i<vt[nod].size();i++)
        if(vaz[vt[nod][i]]) dfs1(vt[nod][i]);
}

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;
        v[non(x)].push_back(y);
        vt[y].push_back(non(x));
        v[non(y)].push_back(x);
        vt[x].push_back(non(y));
    }
    for(int i=1;i<=2*n;i++)
        if(!vaz[i]) dfs(i);
    for(int i=l;i>=1;i--)
        if(vaz[q[i]] && vaz[non(q[i])]) dfs1(q[i]);
    if(!ok) printf("-1");
    else for(int i=1;i<=n;i++) printf("%d ",ans[i]);
    return 0;
}