#include <bits/stdc++.h> // 自己写的
#define int long long
using namespace std;

const int N = 1e5 + 5, M = 1e6 + 5;

int dfn[N], low[N], sta[N], c[N]; // c[x] x所在强联通分量的编号 
bool vis[N];

vector <int> scc[N], e[N], e2[N]; // 编号为i的强联通分量的所有点

int n, m, _dfn, top, cnt;

void tarjan(int u) {
	dfn[u] = low[u] = ++ _dfn;
	sta[++top] = u; 
	vis[u] = 1;
	
	for (int v : e[u])
		if (!dfn[v]) {
			tarjan(v);
			low[u] = min(low[u], low[v]);
		} else if (vis[v]) low[u] = min(low[u], dfn[v]);
		
	if (low[u] == dfn[u]) {
		cnt ++;
		int v;
		do {
			v = sta[top --];
			vis[v] = 0;
			c[v] = cnt;
			scc[cnt].push_back(v);
		} while (v != u);
	}
}

bool vis2[N];
int f[N];
queue <int> q;

void bfs() {
	while (q.size()) {
		int u = q.front();
		//cout << u << "\n";
		q.pop();
		for (int v : e2[u]) {
			if (scc[v].size() > 1) f[v] = 1e18;
			else f[v] ++;
			q.push(v);
		}
	}
}

signed main() {
	cin.tie(0); ios::sync_with_stdio(0);
	int n, m; cin >> n >> m;
	while (m--) {
		int u, v; cin >> u >> v;
		e[u].push_back(v);
	}
	
	for (int i = 1; i <= n; i++)
		if (!dfn[i]) tarjan(i);
	
	for (int u = 1; u <= n; u++)
		for (int v : e[u]) {
			if (c[u] == c[v]) continue;
			e2[c[u]].push_back(c[v]);
		}
	
	e2[0].push_back(c[1]);
	q.push(0);
	
	bfs();
	for (int i = 1; i <= n; i++) {
		if (f[c[i]] == 1e18)  cout << "3 ";
		else if (f[c[i]] > 1) cout << "2 ";
		else if (f[c[i]] == 1) cout << "1 ";
		else cout << "0 ";
	}
	return 0;
}