#include<bits/stdc++.h>
using namespace std;
const int inf=1e9;
int S,T,SS,TT;
struct edge
{
	int v,f,ty;
	edge *next,*rev;
}*h[23333],pool[111111];
int top;
edge* addedge(int u,int v,int c,int tt)
{
//	cerr<<"addedge "<<u<<' '<<v<<' '<<c<<endl;
	edge *tmp=&pool[top++];tmp->v=v;tmp->f=c;tmp->next=h[u];h[u]=tmp;tmp->ty=tt;
	edge *pmt=&pool[top++];pmt->v=u;pmt->f=0;pmt->next=h[v];h[v]=pmt;pmt->ty=0;
	tmp->rev=pmt;pmt->rev=tmp;
	return tmp;
}
edge* addedgeb(int u,int v,int l,int r)
{
	if(l)
	{
		addedge(SS,v,l,0);
		addedge(u,TT,l,0);
	}
	return addedge(u,v,r-l,1);
}
int dep[23333];
bool bfs()
{
	memset(dep,-1,sizeof(dep));
	queue<int> q;
	q.push(SS);
	dep[SS]=0;
	while(not q.empty())
	{
		int u=q.front();q.pop();
		for(edge *tmp=h[u];tmp;tmp=tmp->next)
		{
			if(tmp->f and dep[tmp->v]==-1)
			{
				dep[tmp->v]=dep[u]+1;
				q.push(tmp->v);
			}
		}
		if(dep[TT]!=-1)return true;
	}
	return false;
}
int dinic(int u,int f)
{
//	cerr<<"dinic "<<u<<' '<<f<<endl;
	if(u==TT)return f;
	int totf=0;
	for(edge *tmp=h[u];tmp and totf!=f;tmp=tmp->next)
	{
		if(tmp->f and dep[tmp->v]==dep[u]+1)
		{
			int df=dinic(tmp->v,min(tmp->f,f));
			totf+=df;
			tmp->f-=df;
			tmp->rev->f+=df;
		}
	}
	if(totf==0)dep[u]=-1;
	return totf;
}
int augment()
{
	int tmp=0;
	while(bfs())
	{
		tmp+=dinic(SS,inf);
	}
	return tmp;
}
int main()
{
	ios_base::sync_with_stdio(false);
	int n,m;
	cin>>n>>m;
	vector<vector<int>> G(n+5);
	vector<pair<int,int>> edges;
	for(int i=1;i<=m;i++)
	{
		int u,v;
		cin>>u>>v;
		G[u].push_back(v);
		edges.emplace_back(u,v);
	}
	vector<int> ins(n+5),bel(n+5),dfn(n+5),low(n+5);
	stack<int> st;
	int bcnt=0,ind=0;
	function<void(int)> dfs=[&](int u)
	{
		dfn[u]=low[u]=++ind;
		ins[u]=1;
		st.push(u);
		for(auto v:G[u])
		{
			if(not ins[v])
			{
				dfs(v);
				low[u]=min(low[u],low[v]);
			}
			else if(ins[v]==1)
			{
				low[u]=min(low[u],dfn[v]);
			}
		}
		if(low[u]==dfn[u])
		{
			int v;
			++bcnt;
			do
			{
				v=st.top();st.pop();
				ins[v]=2;
				bel[v]=bcnt;
			}
			while(u!=v);
		}
	};
	for(int i=1;i<=n;i++)
	{
		if(not ins[i])
		{
			dfs(i);
		}
	}
	
//	for(int i=1;i<=n;i++)cerr<<i<<' '<<bel[i]<<endl;
	
	S=bcnt+bcnt+1,T=bcnt+bcnt+2;
	SS=bcnt+bcnt+3,TT=bcnt+bcnt+4;
	vector<int> indeg(bcnt+bcnt+5),outdeg(bcnt+bcnt+5);
	for(auto &[u,v]:edges)
	{
		if(bel[u]!=bel[v])
		{
			addedgeb(bel[u]+bcnt,bel[v],0,inf);
			indeg[bel[v]]++;
			outdeg[bel[u]]++;
		}
	}
	vector<edge*> dedge;
	for(int i=1;i<=bcnt;i++)
	{
		if(indeg[i]==0)addedgeb(S,i,0,inf);
		if(outdeg[i]==0)addedgeb(i+bcnt,T,0,inf);
		dedge.push_back(addedgeb(i,i+bcnt,1,inf));
	}
	auto redge=addedge(T,S,0,0);
	int tot=0,paths;
	tot+=augment();
//	cerr<<"tot "<<tot<<endl;
	for(paths=1;paths<=n;paths++)
	{
		redge->f++;
		tot+=augment();
//		cerr<<"try "<<paths<<' '<<tot<<endl;
		if(tot==bcnt)
		{
			break;
		}
	}
	
//	cout<<paths<<endl;
	//find actual paths
	vector<int> col(bcnt+5);
	function<void(int,int)> dfs2=[&](int u,int id)
	{
//		cerr<<"dfs2 "<<u<<' '<<id<<endl;
		if(u==T)return;
		if(u<=bcnt)col[u]=id;
		for(edge *tmp=h[u];tmp;tmp=tmp->next)
		{
			if(tmp->ty and tmp->rev->f)
			{
				tmp->rev->f--;
				tmp->f++;
				return dfs2(tmp->v,id);
			}
		}
	};
	for(auto e:dedge)e->rev->f++;
	for(int i=1;i<=paths;i++)
	{
		dfs2(S,i);
	}
	for(int i=1;i<=n;i++)
	{
		cout<<col[bel[i]]<<" \n"[i==n];
	}
	return 0;
}