#include <bits/stdc++.h>
#include <fstream>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
template<class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
struct custom_hash {static uint64_t splitmix64(uint64_t x) {x += 0x9e3779b97f4a7c15;x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;x = (x ^ (x >> 27)) * 0x94d049bb133111eb;return x ^ (x >> 31);}size_t operator()(uint64_t x) const {static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();return splitmix64(x + FIXED_RANDOM);}};
string __fname = "2sat"; ifstream in (__fname + ".in"); ofstream out (__fname + ".out"); 
#define cin in 
#define cout out
#define int64 long long
#define uint64 unsigned long long
#define x first
#define y second
#define pb push_back
#define pii pair <int, int> 
#define pii64 pair <int64, int64>
#define db(x) cout << "> " << #x << ": " << (x) << "\n"
#define qr queries()
#define yn(x) if (x) {ctn("Yes");}else {ctn("No");}
void solve(int);
void queries(){int n;cin >> n;for (int i = 1; i <= n; i++) solve(i);}
template<class T>T ceildiv(T a, T b) {return a / b + !!(a % b);}
template<class T>T gcd (T a, T b){return (b ? gcd(b, a % b): a);}
template<class T>T lcm (T a, T b){return a * b / gcd(a, b);}
// // // // // // // // // // // // // // // // // // // // // // 
/*                  TEMPLATE - VANILLA                         */
// // // // // // // // // // // // // // // // // // // // // //
const int ddx[] = {-1, -1, 0, 1, 1, 1, 0, -1};
const int ddy[] = {0, 1, 1, 1, 0, -1, -1, -1};
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
const double pi = 3.14159265359;
const double eps = 1e-6;
const int64 hash_inv = 940594066;
const int64 hash_p = 101;
const int64 mod = 1e9 + 7;
const int maxn = 2e5 + 100;
vector <int> ad [maxn];
vector <int> adrev[maxn];
bitset <maxn> vis;
vector <int> ord;
int rs [maxn];
int comp[maxn];

void solve(int id){
    
    return;
}

void topo (int u) {
    vis[u] = 1;
    for (int i: ad[u]) {
        if (!vis[i]) {
            topo(i);
        }
    }
    ord.push_back(u);
}

void dfs (int u) {
    vis[u] = 1;
    for (int v: adrev[u]) {
        if (!vis[v]) {
            comp[v] = comp[u];
            dfs(v);
        }
    }
}


int main(){
    ios_base::sync_with_stdio(0); cin.tie(0); cout << fixed; cout << setprecision(10); 
    int n,m;
    cin >> n >> m;
    vector <pii> v;
    for (int i = 0; i < m; i++){
        int x,y;
        cin >> x >> y;
        v.push_back({x, y});
        int n1 = x < 0, n2 = y < 0;
        x = abs(x) * 2 ^ n1, y = abs(y) * 2 ^ n2;
        ad[x ^ 1].push_back(y);
        ad[y ^ 1].push_back(x);
        adrev[y].push_back(x ^ 1);
        adrev[x].push_back(y ^ 1);
    }
    for (int i = 2; i <= n * 2 + 1; i++){
        if (!vis[i]) topo(i);
    }
    reverse(ord.begin(), ord.end());
    vis = 0;
    int wh = 1;
    for (int i: ord) {
        if (!vis[i]) {
            comp[i] = wh++;
            dfs(i);
        }
    }
    for (int i = 2; i <= n * 2; i+=2) {
        if (comp[i] == comp[i + 1] && comp[i]) {
            cout << "-1";
            return 0;
        }
        else {
            rs[i] = comp[i] > comp[i + 1],
            rs[i + 1] = !rs[i];
        }
    }
    for (int i = 2; i <= n * 2; i+=2){
        cout << rs[i] << " ";
    }
    return 0;
}