#include <fstream>
#include <vector>

using namespace std;

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

const int NMax = 2e5;

int N, M, Sol[NMax + 5];
bool Use[NMax + 5];
vector <int> G[NMax + 5], GT[NMax + 5], V;

int Non(int x)
{
    return ((x > N) ? x - N : x + N);
}

void Read()
{
    fin >> N >> M;

    for(int i = 1, x, y, nx, ny; i <= M; i++)
    {
        fin >> x >> y;

        if(x < 0) x = Non(-x);
        if(y < 0) y = Non(-y);

        nx = Non(x), ny = Non(y);

        G[nx].push_back(y);
        G[ny].push_back(x);

        GT[x].push_back(ny);
        GT[y].push_back(nx);
    }
}

void DFSP(int Nod)
{
    Use[Nod] = true;

    for(auto Vecin : G[Nod])
        if(!Use[Vecin])
            DFSP(Vecin);

    V.push_back(Nod);
}

bool DFSM(int Nod)
{
    if(Sol[Nod])
    {
        Sol[0] = -1;
        return 0;
    }
    Sol[Non(Nod)] = 1;
    Use[Nod] = true;

    for(auto Vecin : GT[Nod])
        if(!Use[Vecin])
        {
            if(DFSM(Vecin) == 0)
                return 0;
        }
    return 1;
}

void Kosaraju()
{
    for(int i = 1; i <= 2 * N; i++)
        if(!Use[i])
            DFSP(i);

    for(int i = 1; i <= 2 * N; i++)
        Use[i] = 0;

    while(!V.empty())
    {
        int Nod = V.back(); V.pop_back();

        if(!Use[Nod] && !Use[Non(Nod)])
        {
            if(DFSM(Nod) == 0)
                return;
        }
    }
}

void Print()
{
    if(Sol[0] == -1)
        fout << "-1\n";
    else
    {
        for(int i = 1; i <= N; i++)
            fout << Sol[i] << " ";

        fout << '\n';
    }
}

int main()
{
    Read();
    Kosaraju();
    Print();

    fin.close();
    fout.close();

    return 0;
}