#include <fstream>
#include <vector>
using namespace std;
typedef unsigned int uint;

int n, m;
vector<vector<int> > a, ta;
vector<vector<int> > comp;
vector<vector<int> > b;
vector<char> result, viz;
vector<int> w;
vector<int> sorted;

int node(int x)
{
	if (x < 0)
		return n - x;
	return x;
}

void DF1(int v)
{
	viz[v] = 1;

	for(uint i=0;i<a[v].size();++i)
		if(!viz[a[v][i]])
			DF1(a[v][i]);

	sorted.push_back(v);
}

void DF2(int v, int c)
{
	viz[v] = 1;
	w[v] = c;
	comp[c].push_back(v);

	for(uint i=0;i<ta[v].size();++i)
		if(!viz[ta[v][i]])
			DF2(ta[v][i], c);
}

void tareConex()
{
	int sz = 2 * n;
	for(int i=1;i<=sz;++i)
		if(!viz[i])
			DF1(i);

	memset(&viz[0], 0, viz.size());

	for(int i=sorted.size() - 1;i>=0;--i)
		if(!viz[sorted[i]])
		{
			comp.push_back(vector<int>());
			DF2(sorted[i], comp.size() - 1);
		}
	b.resize(comp.size());

	for(uint i=1;i<a.size();++i)
		for(uint j=0;j<a[i].size();++j)
			if (w[i] != w[a[i][j]])
				b[w[i]].push_back(w[a[i][j]]);	
}

void DF3(int v)
{
	viz[v] = 1;

	for(uint i=0;i<b[v].size();++i)
		if(!viz[b[v][i]])
			DF3(b[v][i]);

	sorted.push_back(v);
}

inline bool hasValue(int c)
{
	for(vector<int>::iterator it = comp[c].begin(); it != comp[c].end(); ++ it)
		if (result[*it] == -1)
			return false;
	return true;
}

inline int reverse(int v)
{
	if(v <= n)
		return v + n;
	return v - n;
}

inline void setValue(int c, char v)
{
	for(vector<int>::iterator it = comp[c].begin(); it != comp[c].end(); ++ it)
		result[*it] = v,
		result[reverse(*it)] = !v;
}

void solve()
{	
	sorted.clear();
	memset(&viz[0], 0, viz.size());
	memset(&result[0], -1, result.size());
	for(uint i=0;i<comp.size();++i)
		if(!viz[i])
		{
			DF3(i);
			for (int i = sorted.size() - 1; i >= 0; -- i)
				if(!hasValue(sorted[i]))
					setValue(sorted[i], false);
		}
}

bool hasSolution()
{
	for(int i=1;i<=n;++i)
		if (w[i] == w[i+n])
			return false;
	return true;
}

int main()
{
	ifstream cin("2sat.in");
	ofstream cout("2sat.out");

	int x, y;
	cin >> n >> m;
	a.resize(2 * n + 1); ta.resize(2 * n + 1);
	result.resize(2 * n + 1); viz.resize(2 * n +  1);
	w.resize(2 * n + 1); sorted.reserve(2 * n + 1);
	while (m --)
	{
		cin >> x >> y;
		a[node(-x)].push_back(node(y));
		a[node(-y)].push_back(node(x));
		ta[node(x)].push_back(node(-y));
		ta[node(y)].push_back(node(-x));
	}

	tareConex();

	
	if(!hasSolution())
		cout << -1;
	else
	{
		solve();

		for(int i=1;i<=n;++i)
			cout << (result[i] ? '1' : '0') << " ";
	}

	return 0;
}