WA 0 pts
#include<bits/stdc++.h>
using namespace std;
int n, m;
vector <int> p[100010];
int a[100010];
void solve(int x, int v) {
a[x] = v;
for (int i = 0; i < p[x].size(); x++)
if (!a[p[x][i]]) solve(p[x][i], v);
}
int main() {
cin >> n >> m;
for (int i = 1; i <= m; i++) {
int u, v;
cin >> u >> v;
p[v].push_back(u);
}
for (int i = n; i > 0; i--)
if (!a[i]) solve(i, i);
for (int i = 1; i <= n; i++)
cout << a[i] << " ";
return 0;
}