#include <fstream>
#include <iostream>
#include <queue>
using namespace std;

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

const int Zero = 1e5 + 5, N = 2e5 + 10;

vector <bool> viz(N, 0);
int comp[N], sol[N], totalcomp, n, m, in[N];
vector <int> g[N], gT[N], o, CC[N];
queue <int> Q;

void dfs(int x) {
    viz[x] = 1;
    for (vector <int> :: iterator it = g[x].begin(); it != g[x].end(); ++it)
        if (!viz[*it])
            dfs (*it);
    o.push_back (x);
}

void dfsT(int x) {
    viz[x] = 0;
    CC[totalcomp].push_back (x);
    comp[x] = totalcomp;
    for (vector <int> :: iterator it = gT[x].begin(); it != gT[x].end(); ++it)
        if (viz[*it])
            dfsT(*it);
}

int main() {
    fin >> n >> m;
    for (int i = Zero - n; i <= Zero + n; ++i)
        sol[i] = -1;
    for (int x, y, i = 0; i < m; ++i) {
        fin >> x >> y;
        g[Zero - x].push_back (Zero + y);
        gT[Zero + y].push_back (Zero - x);
        g[Zero - y].push_back (Zero + x);
        gT[Zero + x].push_back (Zero - y);
    }
    for (int i = Zero - n; i <= Zero + n; ++i)
        if (i != Zero && !viz[i])
            dfs(i);
    for (vector <int> :: reverse_iterator it = o.rbegin(); it != o.rend(); ++it)
        if (viz[*it]) {
            dfsT(*it);
            ++totalcomp;
        }
    for (int i = 1; i <= n; ++i)
        if (comp[Zero + i] == comp[Zero - i]) {
            fout << -1;
            return 0;
        }
    for (int i = 0; i < totalcomp; ++i)
        for (vector <int> :: iterator x = CC[i].begin(); x != CC[i].end(); ++x)
            for (vector <int> :: iterator it = g[*x].begin(); it != g[*x].end(); ++it)
                if (comp[*x] != comp[*it])
                    in[comp[*it]]++;
    for (int i = 0; i < totalcomp; ++i)
        if (!in[i])
            Q.push (i);
    while (Q.size()) {
        int now = Q.front(); Q.pop();
        for (vector <int> :: iterator x = CC[now].begin(); x != CC[now].end(); ++x) {
            int node = (*x > Zero) ? *x : 2 * Zero - *x;
            if (sol[node] == -1)
                sol[node] = *x < Zero ? 1 : 0;
            for (vector <int> :: iterator it = g[*x].begin(); it != g[*x].end(); ++it) {
                if (comp[*x] == comp[*it])
                    continue;
                in[comp[*it]]--;
                if (!in[comp[*it]])
                    Q.push (comp[*it]);
            }
        }
    }
    for (int i = Zero + 1; i <= Zero + n; ++i)
        fout << sol[i] << " ";
}