#include <iostream>
#include <fstream>
#include <vector>
#include <cstring>

using namespace std;

const int Nmax = 100001;

vector <int> G[Nmax * 2], GT[Nmax * 2];
int sol[Nmax * 2];
int vis[Nmax * 2];
int postorder[Nmax * 2];

int N, M, P, EXIST_SOL = 1;

inline int neg( int i )
{
    if ( i > N )
            return i - N;
    else
            return i + N;
}

void DFS( int nod )
{
    vis[nod] = 1;

    for ( auto x: G[nod] )
            if ( !vis[x] )
                    DFS( x );

    postorder[ ++P ] = nod;
}

void DFST( int nod )
{
    if ( sol[nod] ) EXIST_SOL = 0;

    vis[nod] = 0;
    sol[ neg( nod ) ] = 1;

    for ( auto x: GT[nod] )
            if ( vis[x] )
                    DFST( x );
}

void SAT2()
{
    for ( int i = 1; i <= 2 * N; ++i )
            if ( !vis[i] )
                    DFS( i );

    for ( int i = P; i >= 1; i-- )
    {
        int nod = postorder[i];

        if ( vis[nod] && vis[ neg( nod ) ] )
                DFST( nod );
    }
}

int main()
{
    freopen("2sat.in", "r", stdin);
    freopen("2sat.out", "w", stdout);

    scanf("%d %d", &N, &M);

    for ( int i = 1, x, y; i <= M; ++i )
    {
        scanf("%d %d", &x, &y);

        if ( x < 0 ) x = -x + N;
        if ( y < 0 ) y = -y + N;

        G[ neg( x ) ].push_back( y );
        G[ neg( y ) ].push_back( x );

        GT[y].push_back( neg( x ) );
        GT[x].push_back( neg( y ) );
    }

    SAT2();

    if ( EXIST_SOL )
    {
        for ( int i = 1; i <= N; ++i )
                printf("%d ", sol[i]);
    }
    else
    {
        printf("-1");
    }

    return 0;
}