#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,id[N],col[N];
namespace Flow{
	const int V=N*2,E=V*2+N*2+N*2;
	int n,s,t,kk,head[V],d[V],cur[V];
	struct edges{
		int to,c,nex;
	}edge[E];
	void init(int x,int y,int z){
		n=x,s=y,t=z,kk=1;
		fill(head,head+1+n,0);
	}
	int add(int u,int v,int c,int cc){
		// debug(u,v,c);
		edge[++kk]={v,c,head[u]},head[u]=kk;
		edge[++kk]={u,cc,head[v]},head[v]=kk;
		return kk-1;
	}
	bool bfs(){
		queue<int>q;
		q.push(s);
		copy(head,head+1+n,cur);
		fill(d,d+1+n,-1),d[s]=0;
		for(int u;!q.empty();){
			u=q.front(),q.pop();
			for(int i=head[u];i;i=edge[i].nex){
				int v=edge[i].to;
				if(edge[i].c&&!~d[v])d[v]=d[u]+1,q.push(v);
			}
		}
		return ~d[t];
	}
	int dfs(int u,int lim=INF){
		if(u==t)return lim;
		int flow=0;
		for(int i=cur[u];i&&flow<lim;i=edge[i].nex){
			cur[u]=i;
			int v=edge[i].to,c=edge[i].c;
			if(!c||d[v]!=d[u]+1)continue;
			int f=dfs(v,min(lim-flow,c));
			if(!f)d[v]=-1;
			edge[i].c-=f,edge[i^1].c+=f,flow+=f;
		}
		return flow;
	}
	int dinic(){
		int flow=0;
		for(;bfs();)flow+=dfs(s);
		return flow;
	}
	vector<int>stk;
	int find(int u,int lim=INF){
		// debug(u,stk);
		if(u==t){
			static int res;
			res++;
			for(int x:stk)if(!col[x])col[x]=res;
			return 1;
		}
		if(0<u&&u<=::n)stk.push_back(u);
		int flow=0;
		for(;cur[u]&&flow<lim;){
			int &i=cur[u];
			if(i%2==0&&edge[i^1].c){
				int f=min(lim-flow,edge[i^1].c);
				edge[i^1].c-=f;
				flow+=find(edge[i].to,f);
			}else i=edge[i].nex;
		}
		if(0<u&&u<=::n)stk.pop_back();
		return flow;
	}
	void solve(int x,int y){
		s=x,t=y;
		copy(head,head+1+n,cur);
		find(s);
	}
	void print(){
		for(int u=0;u<=n;u++){
			for(int i=head[u];i;i=edge[i].nex){
				if(i%2==0){
					if(edge[i].c*2<INF)debug(u,edge[i].to,edge[i].c,edge[i^1].c);
					else debug(u,edge[i].to,"+inf",edge[i^1].c);
				}
			}
		}
	}
}
vector<int>to[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);
	}
}
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);
	}
	int s=0,t=sct+sct+1;
	Flow::init(t,t,s);
	for(int i=1;i<=sct;i++){
		Flow::add(s,i,0,1);
		Flow::add(i+sct,t,0,1);
		id[i]=Flow::add(i,i+sct,INF,0);
	}
	for(int u=1;u<=n;u++){
		for(int v:to[u]){
			if(scc[u]!=scc[v]){
				// debug(scc[u],scc[v]);
				Flow::add(scc[u]+sct,scc[v],INF,0);
			}
		}
	}
	cerr<<Flow::dinic()<<endl;
	for(int i=1;i<=sct;i++){
		Flow::edge[id[i]^1].c++;
	}
	// Flow::print();
	Flow::solve(s,t);
	for(int i=1;i<=n;i++)printf("%d%c",col[scc[i]],"\n "[i<n]);
	return 0;
}