#include <iostream>
#include <fstream>
#include <iomanip>
#include <cstdlib>
#include <vector>
#include <queue>
#include <algorithm>

#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");

#define ll long long
#define ull unsigned long long
#define pb push_back
#define mp make_pair
const int NMax = 5e5 + 5;

int N,M;
short sol[NMax],aux[NMax];
pair<int,int> ex[NMax];
vector< pair<int,int> > v[NMax];

void cpy(short*,short*);
bool test(int,int);
bool eval(int);

int main() {
    in>>N>>M;

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

        v[abs(x)].pb( {i,abs(y)} );
        v[abs(y)].pb( {i,abs(x)} );

        ex[i] = {x,y};
    }

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

    bool ans = true;
    for (int i=1;i <= N;++i) {
        if (sol[i] != -1) {
            continue;
        }

        if (test(i,0) || test(i,1)) {
            cpy(sol,aux);
        }
        else {
            ans = false;
            break;
        }
    }

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

    return 0;
}

bool test(int idx,int val) {
    cpy(aux,sol);

    aux[idx] = val;
    queue<int> Q;
    Q.push(idx);
    while (Q.size()) {
        int curr = Q.front();
        Q.pop();

        for (auto nxt : v[curr]) {
            int pos = nxt.first, lit = nxt.second;

            if (aux[lit] != -1) {
                if (eval(pos)) {
                    continue;
                }
                return false;
            }
            else {

                aux[lit] = 0;
                bool val0 = eval(pos);

                aux[lit] = 1;
                bool val1 = eval(pos);

                if (val0) {
                    if (val1) {
                        aux[lit] = -1;
                        continue;
                    }

                    aux[lit] = 0;
                }
                if (val1) {
                    aux[lit] = 1;
                }

                Q.push(lit);
            }
        }
    }

    return true;
}

void cpy(short* a,short* b) {
    for (int i=1;i <= N;++i) {
        a[i] = b[i];
    }
}

bool eval(int pos) {
    int x = ex[pos].first,
        y = ex[pos].second,
        val1 = aux[abs(x)],
        val2 = aux[abs(y)];

    if (x < 0) {
        val1 ^= 1;
    }
    if (y < 0) {
        val2 ^= 1;
    }

    return val1 || val2;
}