#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
const int nmax=200005;
vector<int> v[nmax],vt[nmax];
bool ap[nmax],val[nmax],viz[nmax];
int ctc[nmax],p[nmax];
int n,m,i,j,x,act,k,y;
inline int no(int x)
{
    return (x+2*n*(x<=n)-n);
}
void dfs1(int x)
{
    viz[x]=1;
    for(int i=0;i<v[x].size();i++)
        if(!viz[v[x][i]])
          dfs1(v[x][i]);
    k++;p[k]=x;
}
void dfs2(int x)
{
    viz[x]=0;ctc[x]=act;
    for(int i=0;i<vt[x].size();i++)
        if(viz[vt[x][i]])
         dfs2(vt[x][i]);
}
int main()
{
    ifstream f("2sat.in");
    ofstream g("2sat.out");
    f>>n>>m;
    for(i=1;i<=m;i++)
    {
        f>>x>>y;
        if(x<0) x=n-x;
        if(y<0) y=n-y;
        v[no(x)].push_back(y);
        vt[y].push_back(no(x));
        v[no(y)].push_back(x);
        vt[x].push_back(no(y));
    }
    for(x=1;x<=2*n;x++)
    {
        if(!viz[x])
            dfs1(x);
    }
    for(j=2*n;j>=1;j--)
    {
        x=p[j];
        ap[x]=1;
        if(ap[no(x)]) val[x]=1;
        else val[x]=0;
        if(viz[x])
            {act++;dfs2(x);}
        if(ctc[x]==ctc[no(x)])
        {
            g<<"-1";
            return 0;
        }
    }
    for(i=1;i<=n;i++)
        g<<val[i]<<' ';
    return 0;
}