#include<bits/stdc++.h>
#define re register
using namespace std;
const int Mxdt=1000000;	//单次大小 
inline char gc(){
	static char buf[Mxdt],*p1=buf,*p2=buf;
	return p1==p2&&(p2=(p1=buf)+fread(buf,1,Mxdt,stdin),p1==p2)?EOF:*p1++;
}
#define gc getchar
inline int read(){
	re int t=0;re char v=gc();
	while(v<'0')v=gc();
	while(v>='0')t=(t<<3)+(t<<1)+v-48,v=gc();
	return t;
}
inline int min(re int x,re int y){return x<y?x:y;}
int gap[100002],bl[100002],dis[100002],n,head[100002],cnt=1,S,T,q[100002],hd,tl,m,deg[100002],v[100002],h1[100002],dfn[100002],tot,low[100002],tim,tp,stk[100002],ist[100002];
struct edge{int to,next,w;}e[800002];
inline void add(re int x,re int y,re int z){e[++cnt]=(edge){y,head[x],z},head[x]=cnt,e[++cnt]=(edge){x,head[y],0},head[y]=cnt;}
inline int bfs(){
	memset(dis,-1,sizeof(dis)),q[hd=tl=1]=S,dis[S]=0;
	while(hd<=tl){
		re int x=q[hd++];
		for(re int i=head[x];i;i=e[i].next)if(e[i].w&&dis[e[i].to]==-1)dis[e[i].to]=dis[x]+1,q[++tl]=e[i].to;
	}
	return dis[T]>=0;
}
inline int dfs(re int x,re int y){
	if(x==T)return y;
	re int dlt=0;
	for(re int i=head[x];y&&(head[x]=i);i=e[i].next)
		if(dis[e[i].to]==dis[x]+1&&e[i].w){
			re int z=dfs(e[i].to,min(y,e[i].w));
			if(!z)dis[e[i].to]=-1;
			else e[i].w-=z,y-=z,e[i^1].w+=z,dlt+=z;
		}
	return dlt;
}
vector<int>G[100002];
inline void tj(re int x){
	dfn[x]=low[x]=++tim,stk[++tp]=x,ist[x]=1;
	for(auto z:G[x]){
		if(!dfn[z])tj(z),low[x]=min(low[x],low[z]);
		else if(ist[z])low[x]=min(low[x],dfn[z]);
	}
	if(low[x]==dfn[x]){
		++tot;
		do{
			bl[stk[tp]]=tot;
			ist[stk[tp]]=0;
		}while(stk[tp--]!=x);
	}
}
vector<int>H[7002];
int U[7002],num;
int main(){
	n=read(),m=read(),S=n+n+1,T=S+1;
	for(re int i=1,x,y;i<=m;++i){
		x=read(),y=read();
		G[x].push_back(y);
	}
	for(re int i=1;i<=n;++i)if(!dfn[i])tj(i);
	for(re int i=1;i<=tot;++i)add(S,i,1),add(i+tot,T,1),add(i+tot,i,1<<30);
	for(re int i=1;i<=n;++i)
		for(auto z:G[i])
			if(bl[i]^bl[z])add(bl[i],bl[z]+tot,1<<30);
	int oo=tot;
	while(bfs()){
		for(re int i=1;i<=T;++i)h1[i]=head[i];
		oo-=dfs(S,1<<30);
		for(re int i=1;i<=T;++i)head[i]=h1[i];
	}
	for(re int i=1;i<=tot;++i)
		for(re int j=head[i];j;j=e[j].next)
			if(e[j].w!=(1<<30)&&e[j].to!=S&&e[j].to!=i+tot){
				re int dlt=(1<<30)-e[j].w;
				while(dlt--)H[i].push_back(e[j].to-tot),++deg[e[j].to-tot];
			}
	for(re int i=1;i<=tot;++i)
		for(re int j=1;j<=tot;++j)
			while(H[j].size()>deg[j]){
				++num;
				re int o=j;U[o]=num;
				while(H[o].size()){
					re int v=H[o][H[o].size()-1];
					H[o].pop_back(),o=v,U[o]=num,--deg[v];
				}
			}
	for(re int i=1;i<=tot;++i)if(!U[i])U[i]=++num;
	for(re int i=1;i<=n;++i)printf("%d ",U[bl[i]]);
}