#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N=1e5+5;
vector<int> G[N],E[N];
int n,m,dfn[N],low[N],s[N],top,TIME,cnt,scc[N],sz[N],a[N],deg[N];
bool inst[N];
void tarjan(int x){
	dfn[x]=low[x]=++TIME;
	inst[x]=true,s[++top]=x;
	for(int v:G[x]){
		if(!dfn[v]){
			tarjan(v);
			low[x]=min(low[x],low[v]);
		} else if(inst[v]) low[x]=min(low[x],dfn[v]);
	}
	if(dfn[x]==low[x]){
		cnt++;
		while(true){
			int u=s[top];top--;
			inst[u]=0;
			scc[u]=cnt;
			sz[cnt]++;
			if(u==x) break;
		}
	}
}
queue<int> q;
signed main(){
	cin>>n>>m;
	for(int i=1;i<=m;i++){
		int u,v;cin>>u>>v;
		G[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:G[u]){
			if(scc[u]==scc[v]) continue;
			E[scc[u]].push_back(scc[v]);
		}
	for(int i=1;i<=cnt;i++){
		sort(E[i].begin(),E[i].end());
		unique(E[i].begin(),E[i].end());
	}
	for(int i=1;i<=cnt;i++)
		if(sz[i]>1) a[i]=1e16;
		else if(scc[1]==i) a[i]=1;
	for(int u=1;u<=cnt;u++)
		for(int v:E[u]) deg[v]++;
	for(int i=1;i<=cnt;i++) if(!deg[i]) q.push(i);
//	cout<<scc[2]<<endl;
	while(!q.empty()){
		int u=q.front();q.pop();
		for(int v:E[u]){
			a[v]+=a[u];
			if(!--deg[v]) q.push(v);
		}
	}
	for(int i=1;i<=n;i++)
		if(!a[scc[i]]) cout<<0<<" ";
		else if(a[scc[i]]==1) cout<<1<<" ";
		else if(a[scc[i]]>1&&a[scc[i]]<(int)(1e13)) cout<<2<<" ";
		else cout<<3<<" "; 
	cout<<endl;
	return 0;
}