#include <bits/stdc++.h>
#define Nmax 100002
using namespace std;

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


int n,m,a,b,ID[2*Nmax],IN[2*Nmax],val[Nmax];
bool uz[2*Nmax];
vector<int> v[2*Nmax],v2[2*Nmax];
vector<int> H;
vector<vector<int> > C;

int NOT(int x){
    if (x > n) x -= n;
    else x += n;
    return x;
}

void dfs(int nod){
    uz[nod] = 1;
    for (auto it : v[nod]) if (!uz[it]) dfs(it);
    H.push_back(nod);
}

void dfs2(int nod){
    uz[nod] = 1;
    for (auto it : v2[nod]) if (!uz[it]) dfs2(it);
    C.back().push_back(nod);
}


int main()
{
    ios::sync_with_stdio(false);
    f >> n >> m;
    for (int i=1;i<=m;i++){
        f >> a >> b;
        if (a<0) a = NOT(-a);
        if (b<0) b = NOT(-b);
        v[NOT(a)].push_back(b);
        v[NOT(b)].push_back(a);
        v2[b].push_back(NOT(a));
        v2[a].push_back(NOT(b));
    }

    for (int i=1;i<=2*n;i++) if (!uz[i]) dfs(i);
    memset(uz,0,sizeof(uz));
    for (auto it = H.rbegin(); it != H.rend(); it++)
        if (!uz[*it]){
            C.push_back(vector<int>());
            dfs2(*it);
        }

//    for (auto it : C){
//        for (auto it2 : it) cout << it2 << ' ';
//        cout << '\n';
//    }

    for (int i=0;i<C.size();i++) for (auto it2 : C[i]) ID[it2] = i;

    for (int i=1;i<=n;i++)
        if (ID[i] == ID[NOT(i)]){
            g << "-1\n";
            return 0;
        }

    memset(val,0xff,sizeof(val));
    for (int i=C.size()-1;i>=0;i--){
        if (C[i].empty() || val[C[i].back()]!=-1) continue;
        for (auto it : C[i]){
            val[it] = 1;
            val[NOT(it)] = 0;
        }
    }
    for (int i=1;i<=n;i++) g << (val[i] == -1 ? 1 : val[i]) << ' ';

//    for (int i=1;i<=n;i++) for (auto it : v[i]) IN[ID[it]]++;
//
//    H.clear();
//    for (int i=0;i<C.size();i++) if (IN[i]==0) H.push_back(i);
//
//    while (!H.empty()){
//
//    }

    return 0;
}