#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
struct edge{
	int Next=0;
	//int Dis;
	int To=0; 
}Edge[100001];
int N,M,Cnt,Head[100001],Ans;
bool Flag[100001];
void Add_Edge(int From,int To){
	Edge[++Cnt].Next=Head[From];
	Edge[Cnt].To=To;
	Head[From]=Cnt;
}
void DFS(int N){
	int i=Head[N];
	Flag[i]=1;
	while(i){
		if(Flag[Edge[i].To]==0){
			DFS(Edge[i].To);
			Ans=max(Ans,Edge[i].To);
		}
		i=Edge[i].Next;
	}
}
int main(){
	scanf("%d%d",&N,&M);
	for(int i=0;i<M;i++){
		int X,Y;
		scanf("%d%d",&X,&Y);
		Add_Edge(X,Y);
	}for(int i=1;i<=N;i++){
		Ans=i;
		memset(Flag,0,sizeof(Flag));
		DFS(i);
		printf("%d ",Ans);
	}
	return 0;
}

MLE20$$分不知肾末原因MLE，求大佬指点。