#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
#include <bits/stdc++.h>

using namespace std;

#define NMAX 200000
#define MMAX 20
#define PMAX 524288
#define LOG 17
#define INF 0x3f3f3f3f
#define BS 127
#define MOD 100003

#define ll long long
#define ull unsigned long long
#define ldb long double

ifstream fin("2sat.in");
ofstream fout("2sat.out");

int n, m, x, y, nx, ny;
vector<int> gr[NMAX + 3], grt[NMAX + 3];
vector<int> ord, comp(NMAX + 2, 0);
vector<bool> viz(NMAX + 2, 0), ans(NMAX + 2, 0);

int index(int x) {
    int var = abs(x) - 1;
    return (x > 0 ? 2 * var : 2 * var + 1);
}

void dfs_1(int nod) {
    viz[nod] = 1;
    for (auto it : gr[nod]) {
        if (!viz[it]) {
            dfs_1(it);
        }
    }
    ord.emplace_back(nod);
}

void dfs_2(int nod, int val) {
    comp[nod] = val;
    for (auto it : grt[nod]) {
        if (!comp[it]) {
            dfs_2(it, val);
        }
    }
}

int main() {
    ios_base::sync_with_stdio(false);
    fin.tie(NULL);
    fout.tie(NULL);

    fin >> n >> m;

    while (m--) {
        fin >> x >> y;
        x = index(x);
        y = index(y);
        nx = x ^ 1;
        ny = y ^ 1;
        gr[nx].emplace_back(y);
        gr[ny].emplace_back(x);
        grt[y].emplace_back(nx);
        grt[x].emplace_back(ny);
    }

    for (int i = 0; i < 2 * n; i++) {
        if (!viz[i]) {
            dfs_1(i);
        }
    }

    for (int i = 2 * n - 1, j = 0; i >= 0; i--) {
        int nod = ord[i];
        if (!comp[nod]) {
            dfs_2(nod, ++j);
        }
    }

    for (int i = 0; i < n; i++) {
        if (comp[2 * i] == comp[2 * i + 1]) {
            fout << -1;
            return 0;
        }
        ans[i] = (comp[2 * i] > comp[2 * i + 1]);
    }

    for (int i = 0; i < n; i++) {
        fout << ans[i] << " ";
    }
    return 0;
}