#include <bits/stdc++.h>
using namespace std;
const long long INF = 1 << 28;
const long long LINF = 1ll << 61;
int n, m, a[100111];
set<pair<int, int> > s;
int main() {
  ios::sync_with_stdio(false);
  cin >> n >> m;
  int x, y;
  for (int i = 1; i <= m; i++) {
    cin >> x >> y;
    s.insert(make_pair(x, y));
  }
  for (int i = 1; i <= n; i++) {
    a[i] = i;
    int k = i;
    while (k > 1 && s.count(make_pair(a[k - 1], a[k])) > 0)
      swap(a[k], a[k - 1]), k--;
  }
  for (int i = 1; i <= n; i++) cout << a[i] << " ";
  cout << endl;
  return 0;
}
