#include<cstdio>
#include<fstream>
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<vector>
#include<bitset>
#include<deque>
#include<queue>
#include<set>
#include<map>
#include<cmath>
#include<cstring>
#include<ctime>
#include<cstdlib>
#include<unordered_map>

#define ll long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define pll pair<ll,ll>

using namespace std;

const int nmax = 100005;

int n, m, i, x, y, cnt;
int tsort[2 * nmax];
int comp[2 * nmax];
bool viz[2 * nmax];

vector<int> v[2 * nmax], g[2 * nmax];

#define v (v + nmax)
#define g (g + nmax)
#define viz (viz + nmax)
#define comp (comp + nmax)

void dfs(int x)
{
    viz[x] = 1;

    for(auto it : v[x])
        if(!viz[it])
            dfs(it);

    tsort[++cnt] = x;
}

void dfst(int x)
{
    viz[x] = 1;
    comp[x] = cnt;

    for(auto it : g[x])
        if(!viz[it])
            dfst(it);
}

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

    scanf("%d%d", &n, &m);

    for(; m; m--)
    {
        scanf("%d%d", &x, &y);
        v[-x].pb(y);
        v[-y].pb(x);
        g[y].pb(-x);
        g[x].pb(-y);
    }

    viz[0] = 1;
    for(i = -n; i <= n; i++)
        if(!viz[i])
            dfs(i);

    cnt = 0;
    for(i = -n; i <= n; i++)
        viz[i] = 0;

    for(i = 2 * n; i; i--)
        if(!viz[tsort[i]])
        {
            cnt++;
            dfst(tsort[i]);
        }

    for(i = 1; i <= n; i++)
        if(comp[i] == comp[-i])
        {
            printf("-1\n");
            return 0;
        }

    for(i = 1; i <= n; i++)
        printf("%d ", comp[i] > comp[-i]);

    return 0;
}