// Problem: C. How Many Paths?
// Contest: undefined - NOIP2024训练赛 10
// URL: http://www.noi.ac/contest/1162/problem/2681
// Memory Limit: 1024 MB
// Time Limit: 1000 ms
// 
// Powered by CP Editor (https://cpeditor.org)

#include <bits/stdc++.h>

using namespace std;

const int N = 4e5 + 5;

int n, m, ans[N];
bool in[N], vis[N];

vector<int> e[N];

void dfs(int now)
{
	vis[now] = in[now] = true; 
	ans[now] = 1;
	for(auto i : e[now])
	{
		if(!vis[i]) dfs(i);
		else if(in[i]) ans[i] = 3;
		else if(ans[i] != 3) ans[i] = 2;
	}
	in[now] = false;
}

void dfs2(int now, int op)
{
	vis[now] = true;
	if(ans[now] != 3 && ans[now] != op) ans[now] = op;
	for(auto i : e[now]) if(!vis[i]) dfs2(i, op);
}

int main()
{
	ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
	cin >> n >> m;
	for(int i = 1; i <= m; i ++)
	{
		int u, v; cin >> u >> v;
		e[u].push_back(v);
	}
	dfs(1);
	memset(vis, 0, sizeof vis);
	for(int i = 1; i <= n; i ++) if(ans[i] == 3) dfs2(i, 3);
	memset(vis, 0, sizeof vis);
	// for(int i = 1; i <= n; i ++) cout << ans[i] << ' '; 
	for(int i = 1; i <= n; i ++) if(ans[i] == 2) dfs2(i, 2);
	for(int i = 1; i <= n; i ++) cout << ans[i] << ' ';
	return 0;
}