#include <bits/stdc++.h>
using namespace std;
vector<int> edge[100000+7];
int m,n;
int ans;
bool vis[100000+7];
void dfs(int b){
	if(b<1||b>=n){
//		ans=max(ans,b);
		return ;
	}
	else{
		for(int i=0;i<edge[b].size();++i){
//			cout<<edge[b][i]<<endl;
			if(vis[edge[b][i]]==0&&edge[b][i]<=n&&edge[b][i]>=1){
				vis[edge[b][i]]==1;
				ans=max(edge[b][i],ans);
				dfs(edge[b][i]);
			}
		}
	}
}
int main(){
	cin>>n>>m;
	for(int i=1;i<=m;++i){
		int u,v;
		cin>>u>>v;
		edge[u].push_back(v);
	}
	for(int i=1;i<=n;++i){
		for(int j=1;j<=n;++j)vis[j]=0;
		ans=i;
		dfs(i);
		cout<<ans<<' ';
	}
	return 0;
}