/// Preset de infoarena
#include <fstream>
#include <vector>
#include <algorithm>

using namespace std;

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

const int maxN = 100005;
int n, m, comp[2 * maxN], nrctc;
vector <int> G[2 * maxN], Gback[2 * maxN], ordine;
bool used[2 * maxN];

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

void dfs1(int nod)
{
    used[nod] = 1;
    for(int vecin : G[nod])
        if(!used[vecin])
            dfs1(vecin);
    ordine.push_back(nod);
}

void dfs2(int nod)
{
    used[nod] = 1;
    comp[nod] = nrctc;
    for(int vecin : Gback[nod])
        if(!used[vecin])
            dfs2(vecin);
}

int main()
{
    fin >> n >> m;
    for(int i = 1; i <= m; i++)
    {
        int x, y;
        fin >> x >> y;
        if(x < 0)
            x = -x + n;
        if(y < 0)
            y = -y + n;
        G[noot(x)].push_back(y);
        G[noot(y)].push_back(x);
        Gback[x].push_back(noot(y));
        Gback[y].push_back(noot(x));
    }
    for(int i = 1; i <= 2 * n; i++)
        if(!used[i])
            dfs1(i);
    for(int i = 1; i <= 2 * n; i++)
        used[i] = 0;
    reverse(ordine.begin(), ordine.end());
    for(int elem : ordine)
    {
        if(used[elem])
            continue;
        nrctc++;
        dfs2(elem);
    }
    bool prost = 0;
    for(int i = 1; i <= n; i++)
        if(comp[i] == comp[i + n])
            prost = 1;
    if(prost)
    {
        fout << "-1";
        return 0;
    }
    else
    {
        for(int i = 1; i <= n; i++)
        {
            if(comp[i] < comp[n + i])
                fout << 0 << ' ';
            else
                fout << 1 << ' ';
        }
    }
    return 0;
}