#include <iostream>
#include <fstream>

using namespace std;

ifstream f("2sat.in");
ofstream g("2sat.out");

int n,m,nrcomp=0;
struct nod
            {int info;
             nod * leg;
            };

nod *mult[200002];
nod *a[200002];
nod *at[200002];
int viz[200002],c[200002],vizt[200002];
int topologie[200002],lg=0;
int contor=0;
int flg[200002];

void add(nod *&p,int val)//adauga in fata
{
    nod *q=new nod;
    q->info=val;
    q->leg=p;
    p=q;

}

void transp()
{int i=1,aux;
nod *p;

for(i=1;i<=2*n;i++)
    {p=a[i];
     while(p!=NULL)
        {add(at[p->info],i);
         p=p->leg;
        }
    }
}

void dfs(int k)
{
viz[k]=1;
nod *p=a[k];
while(p!=NULL)
    {if(viz[p->info]==0) dfs(p->info);
     p=p->leg;
    }
lg++;
topologie[lg]=k;
}

void DfsTrans(int k,int nr)
{
vizt[k]=1;
c[k]=nr;
nod *p=at[k];

while(p!=NULL)
    {if(vizt[p->info]==0) DfsTrans(p->info,nr);
     p=p->leg;
    }
}

void mk(int x,int y)
{int nx,ny;
if(x>0) nx=x+n;
if(y>0) ny=y+n;
if(x<0) {nx=-1*x;x=-1*x+n;}
if(y<0) {ny=-1*y;y=-1*y+n;}
add(a[nx],y);
add(a[ny],x);
}

void read()
{
f>>n>>m;
int i,j;
int x,y,xx,yy;
         for(i=1;i<=m;i++)
               {  f>>x>>y;
                   mk(x,y);
                }
}

void Kosaraju()
{int i;

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

for(i=2*n;i>=1;i--)
    if(vizt[topologie[i]]==0)
         {nrcomp++; DfsTrans(topologie[i],nrcomp); }

for(i=1;i<=2*n;i++)
     {add(mult[c[i]],i);
      contor=max(contor,c[i]);
     }
}

void solve()
{int i;
nod *p;

p=mult[1];
while(p!=NULL)//prima multime va avea toate componente cu flagul 0
      {flg[p->info]=0;
       flg[p->info+n]=1;
       p=p->leg;
      }
//-1=nemarcat
//0,1 marcate
for(i=2;i<=nrcomp;i++)
    {p=mult[i];
     nod *q=new nod;
     q=p;
     int sw=0;
     while(q!=NULL)
        if(flg[q->info]!=-1) {sw=flg[q->info];break;}
        else q=q->leg;
    if(q!=NULL)
       while(p!=NULL)
          { flg[p->info]=sw;
            if(sw==0) flg[p->info+n]=1;
            if(sw==1) flg[p->info+n]=0;
            p=p->leg;
          }
    else//inseamna ca nu e marcat nici un eleent deci il fac tot 0
      while(p!=NULL)
       {flg[p->info]=0;flg[p->info+n]=1;p=p->leg;}
     }
for(i=1;i<=n;i++) g<<flg[i]<<" ";
}

int main()
{
for(int i=1;i<=200002;i++) flg[i]=-1;
read();
transp();
Kosaraju();
solve();
return 0;
}