#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 20, mod = 1e9 + 7;
int n, m, ans[maxn];
map<pair<int, int>, bool> adj;
int main() {
  cin >> n >> m;
  for (int i = 0; i < m; i++) {
    int x, y;
    cin >> x >> y;
    adj[{x, y}] = 1;
  }
  ans[1] = 1;
  for (int i = 2; i <= n; i++) {
    ans[i] = i;
    int j = i - 1;
    while (j > 0 and adj[{ans[j], i}] == 1) {
      swap(ans[j], ans[j + 1]);
      j--;
    }
  }
  for (int i = 1; i <= n; i++) {
    cout << ans[i] << " ";
  }
}
