#include <fstream>
#include <vector>
#define pb push_back
using namespace std;
const int NM = 200005;

ifstream fi("2sat.in");
ofstream fo("2sat.out");


int n;  /// numarul de variabile
int m;  /// numarul de propozitii

vector <int> ADJ[NM];
vector <int> ADJT[NM];
int S[NM],k;
int VIZ[NM];
int nrct;

void df(int nod)
{
    VIZ[nod]=1;
    for (auto varf: ADJ[nod])
        if (VIZ[varf]==0)
            df(varf);
    S[++k]=nod;
}

void dft(int nod)
{
    VIZ[nod]=nrct;
    for (auto varf: ADJT[nod])
        if (VIZ[varf]==0)
            dft(varf);
}

void depth(int nod)
{
    VIZ[nod]=0;
    for (auto varf: ADJ[nod])
        if (VIZ[varf]==-1 && VIZ[varf^1]==-1)
            depth(varf);
}

int main()
{
    fi>>n>>m;
    for (int i=1;i<=m;i++)
    {
        int x,y;
        fi>>x>>y;
        if (x>0) x=x*2;
        else x=-x*2+1;

        if (y>0) y=y*2;
        else y=-y*2+1;

        /// apar doua arce in graful inferentelor

        ADJ[y^1].pb(x);
        ADJ[x^1].pb(y);
        ADJT[x].pb(y^1);
        ADJT[y].pb(x^1);
    }
    /// varfurile sunt numerotate de la 2 la 2*n+1
    /// algoritmul Kosaraju-Sharir
    for (int i=2;i<=2*n+1;i++)
        if (!VIZ[i])
            df(i);
    for (int i=2;i<=2*n+1;i++)
        VIZ[i]=0;
    nrct=0;
    for (int i=k;i>=1;i--)
        if (!VIZ[S[i]])
        {
            nrct++;
            dft(S[i]);
        }
    /// se verifica daca exista x si -x marcate la fel
    int t;
    t=1;
    for (int i=2;i<=2*n;i=i+2)
        if (VIZ[i]==VIZ[i^1])
            t=0;
    if (t==0)
    {
        fo<<-1;
        fi.close();
        fo.close();
        return 0;
    }
    /// se atribuie valori necunoscutelor
    for (int i=2;i<=2*n+1;i++)
        VIZ[i]=-1;
    for (int i=k;i>=1;i--)
        if (VIZ[S[i]]==-1 && VIZ[S[i]^1]==-1)
            depth(S[i]);
    /// afisare
    for (int i=2;i<=2*n;i=i+2)
        if (VIZ[i]!=-1)
            fo<<VIZ[i]<<" ";
        else
            fo<<1-VIZ[i^1]<<" ";
    fi.close();
    fo.close();
    return 0;
}