#include <bits/stdc++.h>

using namespace std;
ifstream fin("2sat.in");
ofstream fout("2sat.out");
const int Nmax=2e5+5;
/// 0->n-1 neg
/// n+1-> 2*n normale
bitset<Nmax> viz;
bitset<Nmax> ans;
vector<int> v[Nmax],inv[Nmax];
vector<int> topo;
bool ok=true;
int n;
int neg(int x)
{
    return 2*n-x;
}
void dfs1(int nod)
{
    viz[nod]=1;
    for(int u:v[nod])
    {
        if(!viz[u]) dfs1(u);
    }
    topo.push_back(nod);
}
void dfs2(int nod)
{
    viz[nod]=1;
    if(ans[nod]==1) ok=false;
    ans[neg(nod)]=true;
    for(int u:inv[nod])
    {
        if(!viz[u]) dfs2(u);
    }
}
int main()
{
    int m;
    fin>>n>>m;
    for(int i=1; i<=m; i++)
    {
        int x,y;
        fin>>x>>y;
        x+=n;
        y+=n;
        ///cout<<x<<' '<<y<<' '<<'\n';
        ///cout<<neg(x)<<' '<<neg(y)<<'\n';
        v[neg(x)].push_back(y);
        v[neg(y)].push_back(x);
        inv[x].push_back(neg(y));
        inv[y].push_back(neg(x));
    }
    for(int i=0; i<2*n; i++)
    {
        if(!viz[i] && i!=n) dfs1(i);
    }
    viz.reset();
    reverse(topo.begin(),topo.end());
    for(int x:topo)
    {
        if(viz[x]) continue;
        if(!ans[x] && !ans[neg(x)])
        {
            dfs2(x);
        }
    }
    if(!ok) fout<<-1<<'\n';
    else
      for(int i=n+1;i<=2*n;i++) fout<<ans[i]<<' ';
    return 0;
}