#include<bits/stdc++.h>
using namespace std;
int n, m, a[100005], head[100005], v[1000005], cnt, p, q, nxt[1000005], low[100005], dfn[100005], num;
int ta[100005], th[100005], tv[1000005], tn[1000005], td[1000005], f[100005], ans;
bool ins[100005], tag[100005];
stack<int> s;
vector<int> scc[100005];
int c[100005];
map<pair<int, int>, bool> ma;
void add() {
	nxt[++cnt] = head[p];
	head[p] = cnt;
	v[cnt] = q;
}
void tarjan(int w) {
	low[w] = dfn[w] = ++cnt;
	s.push(w);
	ins[w] = true;
	for (int i = head[w]; i; i = nxt[i]) {
		if (!dfn[v[i]]) {
			tarjan(v[i]);
			low[w] = min(low[w], low[v[i]]);
		} else if (ins[v[i]]) {
			low[w] = min(low[w], dfn[v[i]]);
		}
	}
	if (dfn[w] == low[w]) {
		num++;
		int y;
		do {
			ins[s.top()] = false;
			c[s.top()] = num;
			scc[num].push_back(s.top());
			y = s.top();
			s.pop();
		} while (y != w);
		if (scc[num].size() != 1) {
			tag[num] = 1;
		}
	}
}
void tad(int p, int q) {
	tn[++cnt] = th[p];
	th[p] = cnt;
	tv[cnt] = q;
}
inline void topo() {
	memset(ins, 0, sizeof(ins));
	queue<int> q;
	for (int i = 1; i <= num; i++) {
		if (td[i] == 0) {
			q.push(i);
			ins[i] = true;
		}
	}
	while (q.size()) {
		int u = q.front();
		q.pop();
		if (tag[u] && f[u]) {
			f[u] = 3;
		}
		for (int i = th[u]; i; i = tn[i]) {
			td[tv[i]]--;
			if (f[u] != 0) {
				if (f[tv[i]] == 0) {
					f[tv[i]] = f[u];
				} else if (f[u] == 1) {
					if (f[tv[i]] == 1) {
						f[tv[i]] = 2;
					}
				} else if (f[u] == 2) {
					if (f[tv[i]] == 1) {
						f[tv[i]] = 2;
					}
				} else {
					f[tv[i]] = 3;
				}
			}
			if (!td[tv[i]]) {
				q.push(tv[i]);
				ins[tv[i]] = true;
			}
		}
	}
}
int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin >> n >> m;
	for (int i = 1; i <= m; i++) {
		cin >> p >> q;
		add();
	}
	cnt = 0;
	for (int i = 1; i <= n; i++) {
		if (!dfn[i]) {
			tarjan(i);
		}
	}
	cnt = 0;
	for (int i = 1; i <= n; i++) {
		for (int j = head[i]; j; j = nxt[j]) {
			if (c[i] != c[v[j]] && ma.find(make_pair(c[i], c[v[j]])) == ma.end()) {
				tad(c[i], c[v[j]]);
				ma[make_pair(c[i], c[v[j]])] = 1;
				ma[make_pair(c[v[j]], c[i])] = 1;
			}
		}
	}
	if (tag[c[1]]) {
		f[c[1]] = 3;
	} else {
		f[c[1]] = 1;
	}
	for (int i = 1; i <= cnt; i++) {
		td[tv[i]]++;
	}
	topo();
	for (int i = 1; i <= n; i++) {
		cout << f[c[i]] << " ";
	}
	return 0;
}