#include<iostream>
#include<cstring>
#include<string>
using namespace std;
int a[10000][10000],n,m,book[1000]; 
int maxx=-1;
void dfs(int num){
	if(num==n){
		maxx==n;
		return;
	}
	if(num>maxx)maxx=num;
	for(int j=1;j<=n;j++){
		if(a[num][j]!=0){
			if(j>maxx)maxx=j;
			dfs(j);
		}
	}
	return;
}
int main(){
	cin >>n>>m;
	int t,t1;
	for(int i=1;i<=m;i++){
		cin >>t>>t1;
		a[t][t1]=1;
		book[t]=1;
	}
	for(int i=1;i<=n;i++){
		if(book[i]==0){
			cout <<i<<" ";
			continue;
		}
		dfs(i);
		cout <<maxx<<" ";
		maxx=-1;
	}
	return 0;
}