#include <fstream>
#include <vector>
#include <string.h>

using namespace std;

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

const int N = 2e5+1;
int n, m, nrSCC;
vector<int> g1[N], g2[N];
int sortTop[N], SCC[N];
bool vis[N], value[N/2];

void dfs1(int i){
    static int cnt = 0;
    vis[i] = 1;
    for(auto node : g1[i]){
        if(vis[node]) continue;
        dfs1(node);
    }
    sortTop[cnt++] = i;
}


void dfs2(int i){
    vis[i] = 1;
    for(auto node : g2[i]){
        if(vis[node]) continue;
        dfs2(node);
    }
    SCC[i]=nrSCC;
}

bool solve(){
    int lim = 2*n-1;
    for(int i=0;i<=lim;++i){
        if(!vis[i]) dfs1(i);
    }
    memset(vis,0,sizeof(vis));
    for(int i=lim;i>=0;--i){
        if(vis[sortTop[i]]) continue;
        dfs2(sortTop[i]);
        ++nrSCC;
    }
    for(int i=0;i <= lim; i += 2){
        if(SCC[i] == SCC[i+1]){
            return 0;
        }
        value[i/2] = SCC[i] > SCC[i+1];
    }
    return 1;
}

int main(){
    in>>n>>m;
    for(int i=0;i<m;++i){
        int a, na, b, nb;
        in>>a>>b;
        if(a<0){
            a = (-a - 1)*2 + 1;
            na = a-1;
        }
        else{
            a = 2*(a-1);
            na = a+1;
        }
        if(b<0){
            b = (-b - 1)*2 + 1;
            nb = b-1;
        }
        else{
            b = 2*(b-1);
            nb = b+1;
        }
        g1[na].push_back(b);
        g1[nb].push_back(a);
        g2[b].push_back(na);
        g2[a].push_back(nb);
    }
    bool ok = solve();
    if(!ok){
        out<<-1;
        return 0;
    }
    for(int i=0;i<n;++i){
        out<<value[i]<<' ';
    }
    return 0;
}