#include <fstream>
#include <vector>
#include <algorithm>
#include <iostream>

using namespace std;

ifstream in("2sat.in");
ofstream out("2sat.out");
int n, m, cnt;
vector<int> v[200005];
vector<int> inv[200005];
int viz[200005];
vector<int> ord;
vector<int> comp[200005];
int mp[200005];
vector<int> top;
int ans[200005];

int normal(int x)
{
    if(x < 0)
    {
        return (n - x);
    }

    return x;
}

int invers(int x)
{
    if(x > n)
    {
        return (x - n);
    }

    return (x + n);
}

void dfs1(int nod)
{
    viz[nod] = 1;

    for(auto it: v[nod])
    {
        if(viz[it] == 0)
        {
            dfs1(it);
        }
    }

    ord.push_back(nod);
}

void dfs2(int nod)
{
    viz[nod] = 1;
    comp[cnt].push_back(nod);
    mp[nod] = cnt;

    for(auto it: inv[nod])
    {
        if(viz[it] == 0)
        {
            dfs2(it);
        }
    }
}

void dfs3(int ctc)
{
    viz[ctc] = 1;

    for(auto nod: comp[ctc])
    {
        for(auto it: v[nod])
        {
            if(viz[mp[it]] == 0)
            {
                dfs3(mp[it]);
            }
        }
    }

    top.push_back(ctc);
}

int main()
{
    in>>n>>m;

    int x, y;
    for(int i = 1; i<=m; i++)
    {
        in>>x>>y;

        x = normal(x);
        y = normal(y);

        //out<<invers(x)<<" "<<y<<'\n';
        //out<<invers(y)<<" "<<x<<'\n';

        v[invers(x)].push_back(y);
        v[invers(y)].push_back(x);

        inv[y].push_back(invers(x));
        inv[x].push_back(invers(y));
    }

    for(int i = 1; i<=2*n; i++)
    {
        if(viz[i] == 0)
        {
            dfs1(i);
        }
    }

    reverse(ord.begin(), ord.end());

    for(int i = 1; i<=2*n; i++)
    {
        viz[i] = 0;
    }

    for(auto it: ord)
    {
        if(viz[it] == 0)
        {
            cnt++;
            dfs2(it);
        }
    }

    for(int i = 1; i<=n; i++)
    {
        if(mp[i] == mp[i + n])
        {
            out<<-1;

            return 0;
        }
    }

    for(int i = 1; i<=cnt; i++)
    {
        viz[i] = 0;
    }

    for(int i = 1; i<=cnt; i++)
    {
        if(viz[i] == 0)
        {
            dfs3(i);
        }
    }

    for(int i = 1; i<=2*n; i++)
    {
        ans[i] = -1;
    }

    //nu mai dau reverse la topsort ca trb sa le iau invers
    for(auto ctc: top)
    {
        for(auto nod: comp[ctc])
        {
            if(ans[nod] == -1)
            {
                ans[nod] = 1;
                ans[invers(nod)] = 0;
            }
        }
    }

    for(int i = 1; i<=n; i++)
    {
        out<<ans[i]<<" ";
    }

    return 0;
}