#include <bits/stdc++.h>

using namespace std;

#define INFILE "2sat.in"
#define OUTFILE "2sat.out"

const int N_MAX = 2e5 + 5;

int n, m;
stack<int> st;
bool solutions;
bool values[N_MAX];
bool visited[N_MAX];
vector<int> adj[N_MAX], revAdj[N_MAX];

int logicalNOT(int value){
    if(value > n) return value - n;
    return value + n;
}

void connectEdge(int node1, int node2){
    adj[node1].push_back(node2);
    revAdj[node2].push_back(node1);
}

void dfs(int node){
    visited[node] = true;
    for(auto &to : adj[node]){
        if(!visited[to]) dfs(to);
    }
    st.push(node);
}

void revDfs(int node){
    if(values[node]) solutions = true;
    visited[node] = true;
    values[logicalNOT(node)] = true;
    for(auto &to : revAdj[node]){
        if(!visited[to]) revDfs(to);
    }
}

void solve(){

    cin >> n >> m;
    for(int i = 0; i < m; ++i){
        int node1, node2; cin >> node1 >> node2;
        if(node1 < 0) node1 = n - node1;
        if(node2 < 0) node2 = n - node2;
        connectEdge(logicalNOT(node1), node2);
        connectEdge(logicalNOT(node2), node1);
    }

    for(int i = 1; i <= 2 * n; ++i){

        if(!visited[i]) dfs(i);

        memset(visited, false, sizeof visited);

        while(!st.empty()){
            int node = st.top();
            st.pop();
            if(!visited[node] && !visited[logicalNOT(node)]){
                revDfs(node);
            }
        }

    }

    if(solutions) cout << -1 << '\n';
    else {
        for(int i = 1; i <= n; ++i){
            cout << (int)values[i] << " ";
        }
        cout << '\n';
    }

}

int main(){
    ios_base::sync_with_stdio(false);
    freopen(INFILE, "r", stdin);
    freopen(OUTFILE, "w", stdout);
    solve();
    return 0;
}