#include <bits/stdc++.h>

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

#define ll long long
#define ld long double

using namespace std;
using namespace __gnu_pbds;

typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;

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

const int NMAX = 2e5;

int n, m, ind, components;
vector<int> g[NMAX + 1], gt[NMAX + 1];
bool visited[NMAX + 1];
int order[NMAX + 1];
int component[NMAX + 1];
bool answer[NMAX + 1];

void AddDisjunction(int a, bool na, int b, bool nb) {
    a = 2 * a - !na;
    b = 2 * b - !nb;
    int neg_a = a + (na ? -1 : 1);
    int neg_b = b + (nb ? -1 : 1);
    g[neg_a].push_back(b);
    g[neg_b].push_back(a);
    gt[b].push_back(neg_a);
    gt[a].push_back(neg_b);
}

void DFS1(int node) {
    visited[node] = 1;
    for(int next_node : g[node]) {
        if(!visited[next_node]) {
            DFS1(next_node);
        }
    }
    order[++ind] = node;
}

void DFS2(int node) {
    component[node] = components;
    for(int next_node : gt[node]) {
        if(!component[next_node]) {
            DFS2(next_node);
        }
    }
}

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    fin >> n >> m;
    for(int i = 1; i <= m; i++) {
        int a, b;
        fin >> a >> b;

        int na = (a < 0);
        int nb = (b < 0);
        AddDisjunction(abs(a), na, abs(b), nb);
    }

    for(int i = 1; i <= 2 * n; i++) {
        if(!visited[i]) {
            DFS1(i);
        }
    }

    for(int i = 2 * n; i >= 1; i--) {
        if(!component[order[i]]) {
            components++;
            DFS2(order[i]);
        }
    }

    for(int i = 1; i <= n; i++) {
        if(component[2 * i - 1] == component[2 * i]) {
            fout << -1 << '\n';
            return 0;
        }
        answer[i] = component[2 * i] < component[2 * i - 1];
    }

    for(int i = 1; i <= n; i++) {
        fout << answer[i] << ' ';
    }

    return 0;
}