#include <fstream>
#include <vector>
#include <stack>
#include <algorithm>

using namespace std;

ifstream cin("2sat.in");
ofstream cout("2sat.out");

const int N=1e5+5;
const int M=2e5+5;

int n,m,x,y,nc;
bool aux_viz[M],aux_viz_t[M],aux_completat[M],aux_ans[M];
bool *viz,*viz_t,*completat,*ans;

vector<int>aux[M],aux_t[M];
vector<int>*v,*v_t;
stack<int>stv;

void dfs(int nod)
{
    viz[nod]=true;
    for(size_t i=0;i<v[nod].size();i++)
    {
        int el=v[nod][i];
        if(viz[el]==0)
        {
            dfs(el);
        }
    }
    stv.push(nod);
}

void dfs_t(int nod)
{
    viz_t[nod]=true;
    if(completat[nod]==0)
    {
        ans[nod]=0;
        ans[-nod]=1;
        completat[nod]=completat[-nod]=1;
    }
    else
    {
        if(ans[nod]==1)
        {
            cout<<-1;
            exit(0);
        }
    }
    for(size_t i=0;i<v_t[nod].size();i++)
    {
        int el=v_t[nod][i];
        if(viz_t[el]==0)
        {
            dfs_t(el);
        }
    }
}

int main()
{
    cin>>n>>m;
    v=aux+N;
    v_t=aux_t+N;
    viz=aux_viz+N;
    viz_t=aux_viz_t+N;
    ans=aux_ans+N;
    completat=aux_completat+N;
    for(int i=1;i<=m;i++)
    {
        cin>>x>>y;
        v[-x].push_back(y);
        v[-y].push_back(x);
        v_t[x].push_back(-y);
        v_t[y].push_back(-x);
    }
    for(int i=-n;i<=n;i++)
    {
        if(viz[i]==0)
        {
            dfs(i);
        }
    }
    while(!stv.empty())
    {
        if(completat[stv.top()]==1)
        {
            stv.pop();
        }
        else if(viz_t[stv.top()]==0)
        {
            dfs_t(stv.top());
            stv.pop();
        }
    }
    for(int i=1;i<=n;i++)
    {
        cout<<ans[i]<<" ";
    }
    return 0;
}