#include<bits/stdc++.h>
using namespace std;
using ll=long long;
#define all(a) (a).begin(),(a).end()
#ifdef DEBUG
template<class T>
ostream& operator << (ostream &out,vector<T> a){
	out<<'[';
	for(T x:a)out<<x<<',';
	return out<<']';
}
template<class T>
vector<T> ary(T *a,int l,int r){
	return vector<T>{a+l,a+1+r};
}
template<class T>
void debug(T x){
	cerr<<x<<endl;
}
template<class T,class...S>
void debug(T x,S...y){
	cerr<<x<<' ',debug(y...);
}
#else
#define debug(...) void()
#endif
const int N=7e3+10,INF=1e9;
int n,m,col[N];
vector<int>to[N],tr[N];
int dft,sct,dfn[N],low[N],scc[N];
void tarjan(int u){
	static int top,stk[N];
	dfn[u]=low[u]=++dft,stk[++top]=u;
	for(int v:to[u]){
		if(!dfn[v])tarjan(v),low[u]=min(low[u],low[v]);
		else if(!scc[v])low[u]=min(low[u],dfn[v]);
	}
	if(low[u]==dfn[u]){
		sct++;
		do scc[stk[top]]=sct;while(stk[top--]^u);
	}
}
bitset<N>a[N],vis;
int match[N],now[N];
bool dfs(int u,int t){
	if(now[u]==t)return 0;
	now[u]=t;
	for(int v=a[u]._Find_first();v<=sct;v=a[u]._Find_next(v)){
		if(!match[v]||dfs(match[v],t))return match[v]=u,1;
	}
	return 0;
}
int main(){
	cin>>n>>m;
	for(int u,v;m--;){
		cin>>u>>v,to[u].push_back(v);
	}
	for(int i=1;i<=n;i++){
		if(!dfn[i])tarjan(i);
	}
	for(int i=1;i<=n;i++)scc[i]=sct-scc[i]+1;
	for(int u=1;u<=n;u++){
		for(int v:to[u]){
			if(scc[u]!=scc[v]){
				tr[scc[v]].push_back(scc[u]);
			}
		}
	}
	for(int i=sct;i>=1;i--){
		a[i][i]=1;
		for(int j:tr[i])a[j]|=a[i];
	}
	for(int i=1;i<=sct;i++)a[i][i]=0;
	// for(int i=1;i<=sct;i++){
	// 	for(int j=1;j<=sct;j++){
	// 		if(to[i][j])debug(i,j);
	// 	}
	// }
	static int cur[N],is[N];
	static mt19937 rnd(time(0));
	iota(cur,cur+1+sct,0);
	shuffle(cur+1,cur+1+sct,rnd);
	for(int T=1;;T++){
		int flag=0;
		for(int x:cur){
			if(!is[x]&&dfs(x,T)){
				is[x]=flag=1;
			}
		}
		if(!flag)break;
		debug(T);
	}
	vis.reset();
	for(int i=1;i<=sct;i++)vis[match[i]]=1;
	for(int i=1,x=0;i<=sct;i++)if(!vis[i]){
		x++;
		for(int u=i;u;u=match[u])col[u]=x;
	}
	for(int i=1;i<=n;i++)printf("%d%c",col[scc[i]],"\n "[i<n]);
	return 0;
}