#include <iostream>
#include <cstdio>
#include <vector>
#include <unordered_set>
#include <cstdio>
#include <ctime>
using namespace std;

int main()
{
	srand(time(NULL));
	ios::sync_with_stdio(false);
	freopen("2sat.in", "r", stdin);
	freopen("2sat.out", "w", stdout);
	int n, m;
	cin >> n >> m;
	vector<int> expr(2*m);
	vector<vector<int>> usein(n);
	vector<bool> notinv(2*m, true);
	for (int i = 0; i < 2*m; i++) {
		cin >> expr[i];
		if (expr[i] < 0) {
			expr[i] = -expr[i];
			notinv[i] = false;
		}
		expr[i]--;
		usein[expr[i]].push_back(i/2);
	}
	vector<bool> b(n);
	for (int i = 0; i < n; i++) {
		b[i] = rand()&1;
	}
	unordered_set<int> t;
	for (int i = 0; i < m; i++) {
		if (!(b[expr[2*i]] == notinv[2*i] || b[expr[2*i+1]] == notinv[2*i+1])) {
			t.insert(i);
		}
	}

	int trial = 0;
	int maxtrial = 10*m;
	while (!t.empty()) {
		int r = 2*(*t.begin());
		if (rand()&1) {
			r += 1;
		}
		r = expr[r];
		b[r] = !b[r];
		for (auto i: usein[r]) {
			if (b[expr[2*i]] == notinv[2*i] || b[expr[2*i+1]] == notinv[2*i+1]) {
				t.erase(i);
			}
			else {
				t.insert(i);
			}
		}
		trial++;
		if (trial > maxtrial) {
			printf("-1\n");
			return 0;
		}
	}
	for (int i = 0; i < n; i++) {
		printf("%c ", b[i] ? '1' : '0');
	}
	printf("\n");
	return 0;
}