#include <bits/stdc++.h>
using namespace std;
/*
#include <ext/pb_ds/priority_queue.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
__gnu_pbds::tree<std::pair<int, int>, __gnu_pbds::null_type,
                 std::less<std::pair<int, int>>, __gnu_pbds::rb_tree_tag,
                 __gnu_pbds::tree_order_statistics_node_update>
    trr;
using namespace __gnu_cxx;
//*/
#define ll long long
#define pi pair<ll, ll>
#define fi first
#define se second
#define N 111111
ll st[N], bj[N], d[N], ins[N], vis[N], pos, n, m, x, y, scc[N], dfn[N], low[N], sccCnt, tot, ans[N];
#define ps(u) (st[++pos] = (u))
#define pop2() (st[pos--])
char s[11];
vector<ll> g[N], g1[N], fa[N];
void print(){
	for(int i = 1 ; i <= n ; i++)
		printf("%lld%c", ans[i], " \n"[i == n]);
}
void debug(ll *a, ll cnt){
	if(cnt <= 0)
		return;
	cerr << *a << " \n"[cnt == 1];
	debug(a + 1, cnt - 1);
}
void check(int u){
	if(ans[u] == 3)
		return;
	ll cnt = 0;
	for(auto v : fa[u]){
		if(ans[v] == 3){
			ans[u] = 3;
			return;
		}
		cnt += ans[v];
	}
	ans[u] = min(2ll, max(1ll, cnt));
	//cerr << u << " " << cnt << "\n";
}
void add(int u, int v, bool bj = false){
	g[u].push_back(v);
	fa[v].push_back(u);
	if(bj)
		add(v, u);
}
void tarjan(int u){
	low[u] = dfn[u] = ++tot;
	ps(u);
	ins[u] = true;
	for(auto v : g[u]){
		if(!dfn[v]){
			tarjan(v);
			low[u] = min(low[u], low[v]);
		}
		else if(ins[v]){
			low[u] = min(low[u], dfn[v]);
		}
	}
	if(dfn[u] == low[u]){
		++sccCnt;
		int v;
		do{
			scc[v = pop2()] = sccCnt;
			ins[v] = false;
		}while(v != u);
	}
}
void dfs(int u, int f){
	if(ans[u])
		return;
	ans[u] = 1;
	if(bj[scc[u]])
		ans[u] = 3;
	for(auto v : g[u]){
		dfs(v, u);
	}
}
int main()
{
	scanf("%lld%lld", &n, &m);
	for(int i = 1 ; i <= m ; i++){
		scanf("%lld%lld", &x, &y);
		add(x, y);
		d[y]++;
	}
	tarjan(1);
	for(int u = 1 ; u <= n ; u++){
		for(auto v : g[u]){
			if(scc[u] == scc[v])
				bj[scc[u]] = 1;
		}
	}
	dfs(1, 1);
	queue<int> q;
	q.push(1);
	while(q.size()){
		int u = q.front();
		q.pop();
		for(auto v : g[u])
			if(!--d[v]){
				q.push(v);
				check(v);
			}
	}
	/*
	for(int u = 1 ; u <= n ; u++)
		for(auto v : fa[u])
			cerr << ans[v] << "(" << v << ")" << "->" << u << "\n";
	//*/
	print();
	return 0;
}
/*
4 4
3 2
2 3
3 4
4 3

*/