#include <bits/stdc++.h> 
using namespace std;
int n, m, u, v, ans;
vector<int> V[100005]; 
void dfs(int p) {
	ans = max(ans, p);
	for (auto x : V[p])
		dfs(x);
}
int main() {
	cin >> n >> m;
	for (int i = 1; i <= m; i++) {
		cin >> u >> v;
		V[u].push_back(v); 
	} 
	for (int i = 1; i <= n; i++) {
		ans = 0;
		dfs(i);
		cout << ans << ' ';
	}
	return 0;
}