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

const int maxN=(2e5)+5;
int n,m,lvl,niv[maxN],low[maxN],st[maxN],vf;
vector<int> v[maxN],C[maxN];
bool inStack[maxN];
bool h[maxN];
int sol[maxN];

inline void fail()
{
    printf("-1\n");
    exit(0);
}
inline int f(int x)
{
    if(x<0) return n-x;
    return x;
}

int ctc,where[maxN];

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

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

    int val=-1;

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

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

        sol[neg(it)]=1^sol[it];
        h[it]=0;
    }

}

void dfs(int nod)
{
    lvl++;
    niv[nod]=low[nod]=lvl;
    st[++vf]=nod;
    inStack[nod]=1;

    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])
    {
        int x=-1;

        ctc++;

        while(x!=nod)
        {
            x=st[vf];
            where[x]=ctc;
            C[ctc].push_back(x);
            inStack[x]=0;
            vf--;
        }
        solve();
    }


}

int x,y,val[maxN];

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);
        x=f(x);
        y=f(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<=2*n;i++)
        if(!niv[i]) dfs(i);


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

    return 0;
}