#include <bits/stdc++.h>
 
using namespace std;

const int MAXN = 1e5 + 10;

vector< int > gr[2*MAXN];
vector< int > gri[2*MAXN];
bool viz[2*MAXN];
int ctc[2*MAXN];

vector< int > v;

int n, m;
inline int ind(int x) {
	if(x > 0) return x;
	return n - x;
}

void dfs(int node) {
	viz[node] = true;
	for(auto &x : gr[node]) {
		if(!viz[x]) dfs(x);
	}
	v.emplace_back(node);
}

void dfs1(int node, int cnt) {
	viz[node] = false;
	for(auto &x : gri[node]) {
		if(viz[x]) dfs1(x, cnt);
	}

	ctc[node] = cnt;
}

int main() {
	#ifdef BLAT
		freopen("input", "r", stdin);
		#define f cin
		#define g cout
	#else
		ifstream f("2sat.in");
    	ofstream g("2sat.out");
    #endif
    f >> n >> m;

    for(int i = 1; i <= m; ++i) {
    	int x, y;
        f >> x >> y;
        gr[ind(-x)].emplace_back(ind(y));
        gri[ind(y)].emplace_back(ind(-x));
 
        gr[ind(-y)].emplace_back(ind(x));
        gri[ind(x)].emplace_back(ind(-y));
    }

    for(int i = 1; i <= 2*n; ++i) {
    	if(!viz[i]) dfs(i);
    }

    reverse(v.begin(), v.end());

    int cnt = 0;
    for(int i = 0; i < 2*n; ++i) {
    	if(viz[v[i]]) {
    		++cnt;
    		dfs1(v[i], cnt);
    	}
    }

    for(int i = 1; i <= n; ++i) {
    	if(ctc[i] == ctc[n+i]) {
    		g << -1;
    		return 0;
    	}
    }

    for(int i = 1; i <= n; ++i) {
    	g << (ctc[i] > ctc[n+i]) << ' ';
    }
    return 0;
}