#include <bits/stdc++.h>

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

#define ll long long
#define ull unsigned long long
#define ui unsigned int
#define pb push_back
#define mp make_pair
const int NMax = 1e5 + 5;
const int MMax = 2e5 + 5;
const int inf = 1e9 + 5;
using zint = int;

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

void getStack(int);
void getComp(int);
void update(int,int);

#define inv(x) (x > N) ? x-N : x+N
int main() {
    in>>N>>M;
    for (int i=1;i <= M;++i) {
        int x,y;
        in>>x>>y;

        x = (x < 0) ? -x + N : x;
        y = (y < 0) ? -y + N : y;
        v[inv(x)].pb(y);
        rev[y].pb(inv(x));
        v[inv(y)].pb(x);
        rev[x].pb(inv(y));
    }

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

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

        getStack(i);
    }

    while (st.size()) {
        int lit = st.top(); st.pop();
        if (compOf[lit] != 0) {
            continue;
        }

        ++nrComp;
        getComp(lit);
    }

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

    if (ans) {
        for (int c=1;c <= nrComp;++c) {
            update(c,0);
        }

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

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

void getStack(int node) {
    visStack[node] = true;

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

        getStack(nxt);
    }

    st.push(node);
}

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

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

        getComp(nxt);
    }
}

void update(int c,int val) {
    int x = comp[c][0];
    if (x > N) {
        x -= N;
    }

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

    for (int nxt : comp[c]) {
        int temp = val;
        if (nxt > N) {
            nxt -= N;
            temp ^= 1;
        }

        sol[nxt] = temp;
    }
}