#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("2sat.in");
ofstream fout("2sat.out");
#define MAX 100010
#define t MAX
typedef vector <int> :: iterator iter;
vector <int> G[2 * MAX];
int viz[2 * MAX], ok[2 * MAX], st[2 * MAX], dr, n, m, i, x, y;
pair<int, int> e[MAX];

void df(int nod)
{
    viz[nod] = 1;
    for(iter it = G[nod].begin() ; it != G[nod].end() ; it++)
    {
        if(!viz[*it])
        {
            df(*it);
        }
    }
    st[++dr] = nod;
}

int main()
{
    fin >> n >> m;
    for(i = 1 ; i <= m ; i++)
    {
        fin >> x >> y;
        e[i] = make_pair(t + x, t + y);
        G[t - x].push_back(t + y);
        G[t - y].push_back(t + x);
    }
    for(i = t - n ; i <= t + n ; i ++)
    {
        if(i == t)
            continue;
        if(!viz[i])
            df(i);
    }
    for(i = dr ; i >= 1 ; i--)
    {
        if(ok[st[i]] == 0 && ok[2 * t - st[i]] == 0)
            ok[2 * t - st[i]] = 1;
    }
    bool oky = 1;
    for(i = 1 ; i <= m ; i++)
    {
        if(ok[e[i].first] == 0 && ok[e[i].second] == 0)
            oky = 0;
    }
    if(oky == 0)
    {
        fout << "-1\n";
    }
    else
    {
        for(i = 1 ; i <= n ; i++)
        {
            fout << ok[t + i] << " ";
        }
        fout << "\n";
    }



}