# include <algorithm>
# include <cstdio>
# include <cstring>
# include <vector>
using namespace std;

const char *FIN = "2sat.in", *FOU = "2sat.out";
const int MAX = 200005;

int N, M;
vector <int> GP[MAX], GM[MAX], Q;
bool VIZ[MAX], sol[MAX];

inline int NOT (int A) {
    return A > N ? A - N : A + N;
}

void dfp (int S) {
    VIZ[S] = 1;
    for (vector <int> :: iterator it = GP[S].begin (); it != GP[S].end (); ++it)
        if (VIZ[*it] == 0)
            dfp (*it);
    Q.push_back (S);
}

void dfm (int S) {
    if (sol[S]) M = -1;
    VIZ[S] = sol[NOT(S)] = 1;
    for (vector <int> :: iterator it = GM[S].begin (); it != GM[S].end (); ++it)
        if (VIZ[*it] == 0)
            dfm (*it);
}

inline void make_pos (int &A) {
    A = A < 0 ? N - A : A;
}

int main (void) {
    freopen (FIN, "r", stdin);

    scanf ("%d %d", &N, &M);
    for (int i = 1, x, y; i <= M; ++i) {
        scanf ("%d %d", &x, &y), make_pos (x), make_pos (y);
        GP[NOT (x)].push_back (y);
        GP[NOT (y)].push_back (x);
        GM[y].push_back (NOT (x));
        GM[x].push_back (NOT (y));
    }
    for (int i = 1; i <= N << 1; ++i)
        if (VIZ[i] == 0)
            dfp (i);
    memset (VIZ, 0, sizeof (VIZ)), reverse (Q.begin (), Q.end ());
    for (vector <int> :: iterator it = Q.begin (); it != Q.end (); ++it)
        if (VIZ[*it] == 0 && VIZ[NOT (*it)] == 0)
            dfm (*it);
    if (M == -1) fprintf (fopen (FOU, "w"), "-1");
    else {
        freopen (FOU, "w", stdout);
        for (int i = 1; i <= N; ++i)
             printf ("%d ", sol[i]);
    }
}