#include<bits/stdc++.h>
using namespace std;

int n;

const int maxN=(2e5)+5;

inline int neg(int x)
{
    if(x>n) return x-n;
    return x+n;
}

int sol[maxN];

vector<int> C;

bool h[maxN];

inline void fail()
{
    printf("-1\n");
    exit(0);
}

inline void solve()
{
    for(auto it:C)
    {
        h[it]=1;
        if(h[neg(it)]) fail();
    }

    int val=-1;
    for(auto it:C)
    {
        if(sol[it]!=-1)
        {
            val=sol[it];
            break;
        }
    }

    for(auto it:C)
    {
        if(val!=-1) sol[it]=0;
            else sol[it]=-1;
        sol[neg(it)]=1^sol[it];
        h[it]=0;
    }
}

int st[maxN],niv[maxN],vf,lvl,low[maxN];
vector<int> v[maxN];

bool inStack[maxN];

void dfs(int nod)
{
    st[++vf]=nod;
    inStack[nod]=1;
    lvl++;
    low[nod]=lvl;
    niv[nod]=lvl;
    for(auto it:v[nod])
    {
        if(!niv[it])
        {
            dfs(it);
            low[nod]=min(low[nod],low[it]);
        }
            else
        if(inStack[it])
        {
            low[nod]=min(low[nod],low[it]);
        }
    }

    if(low[nod]==niv[nod])
    {
        C.clear();
        int x;
        do
        {
            x=st[vf];
            C.push_back(st[vf]);
            vf--;
            inStack[x]=0;
        }while(x!=nod);

        solve();
    }
}
int m,x,y;

int main()
{
    freopen("2sat.in","r",stdin);
    freopen("2sat.out","w",stdout);

    scanf("%d%d",&n,&m);

    for(int i=1;i<=m;i++)
    {
        scanf("%d%d",&x,&y);
        if(x<0) x=n-x;
        if(y<0) y=n-y;
        v[neg(x)].push_back(y);
        v[neg(y)].push_back(x);
    }

    for(int i=1;i<=2*n;i++)
        sol[i]=-1;

    for(int i=1;i<=n;i++)
        if(!niv[i]) dfs(i);

    for(int i=1;i<=n;i++)
        printf("%d ",sol[i]);
    printf("\n");
    return 0;
}