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

int n, m, k, nr, NR;
int st[200005], val[200005], d[200005], id[200005];
int r[200005];
bool f[200005];
vector <int> v[200005];
vector <int> ctc[200005];
inline int neg(int x){
    if(x > 0) return x + n;
    else return abs(x);
}
inline int ret(int x){
    if(x <= n) return x;
    else return x - n;
}
inline void dfs(int nod){
    st[++NR] = nod;
    f[nod] = 1;
    d[nod] = id[nod] = ++k;
    for(auto it : v[nod]){
        if(d[it] == 0){
            dfs(it);
            d[nod] = min(d[nod], d[it]);
        }
        else if(f[it]) d[nod] = min(d[nod], d[it]);
    }
    if(d[nod] == id[nod]){
        ++nr;
        while(st[NR] != nod){
            int x = st[NR--];
            f[x] = 0;
            ctc[nr].push_back(x);
        }
        int x = st[NR--];
        f[x] = 0;
        ctc[nr].push_back(x);
    }
}
int main()
{
    freopen("2sat.in", "r", stdin);
    freopen("2sat.out", "w", stdout);
    scanf("%d%d", &n, &m);
    int x, y, nx, ny;
    for(int i = 1; i <= m ; ++i){
        scanf("%d%d", &x, &y);
        nx = -x; ny = -y;
        x = neg(x); ny = neg(ny);
        nx = neg(nx); y = neg(y);
        v[nx].push_back(y);
        v[ny].push_back(x);
    }
    for(int i = 1; i <= n * 2 ; ++i){
        if(d[i]) continue ;
        NR = 0; dfs(i);
    }
    for(int i = 1; i <= n ; ++i) val[i] = -1;
    bool ok = 1;
    for(int i = nr; i >= 1 ; --i){
        for(auto it : ctc[i]){
            int x = it;
            x = ret(it);
            if(r[x] == i){printf("-1"); return 0;}
            r[x] = i;
            if(val[x] != -1) continue ;
            if(it <= n) val[x] = 1;
            else val[x] = 0;
        }
    }
    for(int i = 1; i <= n ; ++i)
        printf("%d ", val[i]);
    return 0;
}