#include <bits/stdc++.h>
 
using namespace std;
 
ifstream in("2sat.in");
ofstream out("2sat.out");
 
int notX(int x, int n)
{
    if (x<=n)
        return x+n;
    else
        return x-n;
}
 
vector <int> graph[200005];
vector <int> graphTrs[200005];
 
bool viz[200005];
stack <int> st;
 
void dfs(int node)
{
  viz[node]=1;
  for (auto x:graph[node])
      if (!viz[x])
          dfs(x);
  st.push(node);
}
 
vector <int> componente[200005];
int poz[400005];
 
void dfs2(int node, int cnt)
{
    viz[node]=1;
    poz[node] = cnt;
    componente[cnt].push_back(node);
    for (auto x:graphTrs[node])
        if (!viz[x])
            dfs2(x, cnt);
}
int main()
{
    int n, m;
    in>>n>>m;
    for (int i=1;i<=m;i++)
    {
        int a,b;
        in>>a>>b;
        if (a < 0)
            a = -a + n;
        if (b < 0)
            b = -b + n;
        graph[notX(a, n)].push_back(b);
        graph[notX(b, n)].push_back(a);
        graphTrs[b].push_back(notX(a, n));
        graphTrs[a].push_back(notX(b, n));
    }
    for (int i=1;i<=n*2;i++)
    {
        if (!viz[i])
            dfs(i);
    }
    memset(viz,false,sizeof(viz));
    int cnt = 0;
    while (!st.empty())
    {
        int node=st.top();
        st.pop();
        if (!viz[node])
        {
            cnt++;
            dfs2(node,cnt);
        }
    }
    for (int i=1;i<=n;i++)
        if (poz[i]==poz[i+n])
        {
            out<<"-1";
            return 0;
        }
    vector <int> ans(n*2+5,-1);
    for (int i=1;i<=cnt;i++)
    {
        bool must0 = 0;
        bool must1 = 0;
        for (auto node: componente[i])
        {
           int negatie=notX(node, n);
           if (ans[poz[negatie]]==1)
               must0=1;
           else if (ans[poz[negatie]]==0)
               must1=1;
        }
        if (must0 && must1)
        {
            out<<"-1";
            return 0;
        }
        if (must1)
            ans[i] = 1;
        else
            ans[i] = 0;
    }
    memset(viz,0,sizeof(viz));
    for (int i=1;i<=n*2;i++)
        if (ans[poz[i]] == 1)
            for (auto next: graph[i])
                if (ans[poz[next]] == 0)
                {
                    out<<"-1";
                    return 0;
                }
    for (int i=1;i<=n;i++)
        out<<ans[poz[i]]<<" ";
 
}