#include <iostream>
#include <fstream>
#include <vector>
#include <stack>

using namespace std;

ifstream f ("2sat.in");
ofstream g ("2sat.out");

const int N_MAX = 100005;

int n, m, cnt;
int comp[2 * N_MAX];

vector <int> adj[2 * N_MAX], adj_t[2 * N_MAX];
vector <bool> visited(2 * N_MAX, false);

stack <int> s;

inline int ValAsoc(int x)
{
    return (x > 0) ? (x) : (-x + n);
}

inline int Negate(int x)
{
    return (x <= n) ? (x + n) : (x - n);
}

void Read()
{
    f >> n >> m;
    for (int i = 1; i <= m; i++)
    {
        int x, y;
        f >> x >> y;

        x = ValAsoc(x);
        y = ValAsoc(y);

        adj[Negate(x)].push_back(y);
        adj[Negate(y)].push_back(x);

        adj_t[x].push_back(Negate(y));
        adj_t[y].push_back(Negate(x));
    }
}

void DFS1(int node)
{
    visited[node] = true;
    for (unsigned int i = 0; i < adj[node].size(); i++)
    {
        int neighbour = adj[node][i];
        if (visited[neighbour] == false)
        {
            DFS1(neighbour);
        }
    }
    s.push(node);
}

void DFS2(int node)
{
    comp[node] = cnt;
    for (unsigned int i = 0; i < adj_t[node].size(); i++)
    {
        int neighbour = adj_t[node][i];
        if (comp[neighbour] == 0)
        {
            DFS2(neighbour);
        }
    }
}

void Solve()
{
    for (int i = 1; i <= 2 * n; i++)
    {
        if (visited[i] == false)
        {
            DFS1(i);
        }
    }

    while (s.empty() == false)
    {
        int node = s.top();
        if (comp[node] == 0)
        {
            cnt++;
            DFS2(node);
        }
        s.pop();
    }
}

void Print()
{
    for (int i = 1; i <= n; i++)
    {
        if (comp[i] == comp[i + n])
        {
            g << "-1";
            return;
        }
    }

    for (int i = 1; i <= n; i++)
    {
        if (comp[i] > comp[i + n])
        {
            g << "1 ";
        }
        else
        {
            g << "0 ";
        }
    }
}

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

    return 0;
}