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

#define Not(nr) ((nr <= N) ? (nr + N) : (nr - N))
#define newn G[nod][i]

using namespace std;

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

const int Nmax = 2e5 + 100;

int N, M;
queue <int> q, initialize;
vector <bool> viz(Nmax), val(Nmax);
vector <int> G[Nmax];

bool DFS(int nod)
{
    q.push(nod);
    for(unsigned i = 0; i < G[nod].size(); i++)
        if(viz[newn])
            if(!val[newn]) return 0;
            else;
        else
        {
            viz[newn] = viz[Not(newn)] = 1;
            val[newn] = 1; val[Not(newn)] = 0;
            if(!DFS(Not(newn)))
                return 0;
        }
    return 1;
}

bool Right(int nod, bool v)
{
    val[nod] = v; val[Not(nod)] = v ^ 1;
    viz[nod] = viz[Not(nod)] = 1;
    if(v == 0)
        return DFS(nod);
    else
        return DFS(Not(nod));
}

void Clear()
{
    while(!q.empty())
    {
        int x = q.front(); q.pop();
        viz[x] = viz[Not(x)] = 0;
    }
}

int main()
{
    fin >> N >> M;
    for(int i = 1; i <= M; i++)
    {
        int a, b; fin >> a >> b;
        if(a < 0) a = Not(-a);
        if(b < 0) b = Not(-b);
        G[a].push_back(b);
        G[b].push_back(a);
    }

    for(int i = 1; i <= N; i++)
        if(!viz[i])
            if(!Right(i, 0))
            {
                Clear();
                if(!Right(i, 1))
                {
                    fout << "-1";
                    return 0;
                }
                q = initialize;
            }
    for(int i = 1; i <= N; i++)
        fout<<val[i]<<' ';
    return 0;
}