#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define pf push_front
#define MOD 1000000007
#define MAX 100005

using namespace std;

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

vector < int > a, v[2*MAX], cv[2*MAX];
int nr, componenta[2*MAX];
bool viz[2*MAX];

void dfs1(int nod);
void dfs2(int nod);

int main()
{
    map < pair < int, int >, bool > h;
    int n, m, x, y, i, val[MAX];

    fin >> n >> m;
    for(i = 1; i <= m; i++)
    {
        fin >> x >> y;
        if(x < 0) x = -x + n;
        if(y < 0) y = -y + n;

        if(h[{x, y}] == 0)
        {
            h[{x, y}] = 1;
            if(x > n) v[x-n].pb(y), cv[y].pb(x - n);
            else v[x+n].pb(y), cv[y].pb(x + n);

            if(y > n) v[y-n].pb(x), cv[x].pb(y - n);
            else v[y+n].pb(x), cv[x].pb(y + n);
        }
    }
    for(i = 1; i <= 2 * n; i++) if(viz[i] == 0) dfs1(i);
    reverse(a.begin(), a.end());


    for(int it:a) if(componenta[it] == 0)
    {
        nr++;
        dfs2(it);
    }
    bool ok = 1;
    for(i = 1; i <= n && ok == 1; i++) if(componenta[i] == componenta[i+n]) ok = 0;

    if(ok == 0) fout << -1;
    else
    {
        for(i = 1; i <= n; i++) val[i] = -1;
        for(int it:a)
        {
            if(it <= n && val[it] == -1) val[it] = 0;
            else if(it > n && val[it-n] == -1) val[it-n] = 1;
        }

        for(i = 1; i <= n; i++) fout << val[i] << ' ';
    }


    return 0;
}

void dfs1(int nod)
{
    viz[nod] = 1;
    for(int it:v[nod]) if(viz[it] == 0) dfs1(it);
    a.pb(nod);
}

void dfs2(int nod)
{
    componenta[nod] = nr;
    for(int it:cv[nod]) if(componenta[it] == 0) dfs2(it);
}