#include <bits/stdc++.h>

#if 1
#define pv(x) cout<<#x<<" = "<<x<<"; ";cout.flush()
#define pn cout<<endl
#else
#define pv(x)
#define pn
#endif

using namespace std;
ifstream in("2sat.in");
ofstream out("2sat.out");

using ll = long long;
using ull = unsigned long long;
using uint = unsigned int;
#define pb push_back
#define mp make_pair
#define neg(x) ((x > N) ? x - N : x + N)
const int NMax = 2e5 + 5;
const int inf = 1e9 + 5;
using zint = int;

int N,M,nrComp;
int compOf[NMax],sol[NMax];
bool inStack[NMax];
vector<int> v[NMax],rev[NMax],comp[NMax];
stack<int> st;

void buildStack(int);
void getComp(int);
void setComp(int);

int main() {
    in>>N>>M;
    for (int i = 1;i <= M;++i) {
        int x,y;
        in>>x>>y;

        if (x < 0) {
            x = N - x;
        }
        if (y < 0) {
            y = N - y;
        }

        v[ neg(x) ].pb(y);
        rev[y].pb( neg(x) );
        v[ neg(y) ].pb(x);
        rev[x].pb( neg(y) );
    }

    for (int i = 1;i <= 2*N;++i) {
        if ( inStack[i] ) {
            continue;
        }

        buildStack(i);
    }

    while (st.size()) {
        int node = st.top();
        st.pop();

        if (compOf[node] != 0) {
            continue;
        }

        ++nrComp;
        getComp(node);
    }

    bool ans = true;
    for (int i = 1;i <= N;++i) {
        if (compOf[i] == compOf[neg(i)]) {
            ans = false;
            break;
        }
    }

    if (ans) {
        for (int i = 1;i <= 2*N;++i) {
            sol[i] = -1;
        }

        for (int i = 1;i <= nrComp;++i) {
            setComp(i);
        }

        for (int i = 1;i <= N;++i) {
            out<<sol[i]<<' ';
        }
    }
    else {
        out<<-1;
    }

    in.close();out.close();
    return 0;
}

void buildStack(int node) {
    inStack[node] = true;

    for (int nxt : v[node]) {
        if (inStack[nxt]) {
            continue;
        }

        buildStack(nxt);
    }

    st.push(node);
}

void getComp(int node) {
    comp[nrComp].pb(node);
    compOf[node] = nrComp;

    for (int nxt : rev[node]) {
        if (compOf[nxt] != 0) {
            continue;
        }

        getComp(nxt);
    }
}

void setComp(int idx) {
    int node = comp[idx][0];

    if (sol[node] != -1) {
        return;
    }

    for (int node : comp[idx]) {
        sol[node] = 0;
        sol[neg(node)] = 1;
    }
}