#include <bits/stdc++.h>

using namespace std;

#define FILE_IO

int N, M;

namespace _2SAT
{
    int N2, C;
    bool solution;
    int O, ord[200005], f[200005];
    int val[200005], scc[200005];
    vector<int> edg[200005], redg[200005];

    void init()
    {
        N2 = 2 * N;
        C = O = 0;
        for(int i = 0; i < N2; i++)
        {
            edg[i].clear(), redg[i].clear();
            val[i] = scc[i] = ord[i] = 0;
        }
    }

    int node(int x) { return (x < 0 ? (-x * 2 - 1) : (2 * x - 2)); }

    void addEdge(int x, int y)
    {
        edg[node(x)].push_back(node(y));
        redg[node(y)].push_back(node(x));
    }

    void addCondition(int x, int y)
    {
        addEdge(-x, y);
        addEdge(-y, x);
    }

    void setValue(int x, int v)
    {
        if(v == 0)  addEdge(x, -x);
        if(v == 1)  addEdge(-x, x);
    }

    void DFS(int nod)
    {
        if(f[nod])  return;
        f[nod] = 1;
        for(auto nxt: edg[nod]) DFS(nxt);
        ord[++O] = nod;
    }

    void DFS2(int nod)
    {
        if(!f[nod]) return;
        f[nod] = 0;
        scc[nod] = C;
        for(auto nxt: redg[nod])    DFS2(nxt);
    }

    void getSCC()
    {
        for(int i = 0; i < N2; i++) DFS(i);
        for(int i = N2 - 1; i >= 0; i--)
            if(f[ ord[i] ])
            {
                C++;
                DFS2(ord[i]);
            }
    }

    void solve()
    {
        solution = true;

        getSCC();

        for(int i = 1; i <= N; i++)
            if(scc[node(i)] == scc[node(-i)])
            {
                solution = false;
                return;
            }

        for(int i = 1; i <= N; i++)
            val[i] = (scc[node(i)] < scc[node(-i)] ? 0 : 1);
    }
}

int main()
{
    #ifdef FILE_IO
    freopen("2sat.in", "r", stdin);
    freopen("2sat.out", "w", stdout);
    #endif

    scanf("%d%d", &N, &M);
    _2SAT::init();
    for(int i = 1; i <= M; i++)
    {
        int x, y;
        scanf("%d%d", &x, &y);
        _2SAT::addCondition(x, y);
    }

    _2SAT::solve();
    if(_2SAT::solution == false)
    {
        printf("-1\n");
        exit(0);
    }
    for(int i = 1; i <= N; i++)
        printf("%d ", _2SAT::val[i]);

    return 0;
}