#include <cstdio>
#define MAXN 100000
#define MAXM 200000
int n, val[2*MAXM+1], next[2*MAXM+1], e[2*MAXM+1], urm[2*MAXM+1], list[2*MAXN+1], lista[2*MAXN+1], v[2*MAXN+1], u, r, s;
bool viz[2*MAXN+1], ans[2*MAXN+1], q;
inline int non(int x){
    if(x<=n) return x+n;
    else return x-n;
}
void dfs1(int x){
    int p=lista[x];
    viz[x]=1;
    while(p){
        if(viz[val[p]]==0){
            dfs1(val[p]);
        }
        p=next[p];
    }
    v[++u]=x;
}
void dfs2(int x){
    int p=list[x];
    viz[x]=0;
    if(ans[x]){
        q=1;
    }
    ans[non(x)]=1;
    while(p){
        if(viz[e[p]]){
            dfs2(e[p]);
        }
        p=urm[p];
    }
}
inline void adauga(int x, int y){
    r++;
    val[r]=y;
    next[r]=lista[x];
    lista[x]=r;
}
inline void add(int x, int y){
    s++;
    e[s]=y;
    urm[s]=list[x];
    list[x]=s;
}
int main(){
    int m, i, x, y;
    FILE *fin, *fout;
    fin=fopen("2sat.in", "r");
    fout=fopen("2sat.out", "w");
    fscanf(fin, "%d%d", &n, &m);
    for(i=0; i<m; i++){
        fscanf(fin, "%d%d", &x, &y);
        if(x<0){
            x=n-x;
        }
        if(y<0){
            y=n-y;
        }
        adauga(non(x), y);
        adauga(non(y), x);
        add(y, non(x));
        add(x, non(y));
    }
    for(i=1; i<=2*n; i++){
        if(viz[i]==0){
            dfs1(i);
        }
    }
    for(i=u; i>0; i--){
        if((viz[v[i]])&&(viz[non(v[i])])){
            dfs2(v[i]);
        }
    }
    if(q){
        fprintf(fout, "-1\n");
    }else{
        for(i=1; i<n; i++){
            fprintf(fout, "%d ", ans[i]);
        }
        fprintf(fout, "%d\n", ans[n]);
    }
    fclose(fin);
    fclose(fout);
    return 0;
}