#include <bits/stdc++.h>
using namespace std;
pair<int, int> arr[102400];
int ans[102400];
int main() {
  ios::sync_with_stdio(false);
  int n, m;
  cin >> n >> m;
  for (int i = 0; i < m; i++) {
    cin >> arr[i].first >> arr[i].second;
    arr[i].first--;
    arr[i].second--;
  }
  sort(arr, arr + m);
  for (int i = 0; i < n; i++) {
    ans[i] = i;
    int np = i;
    while (np > 0 && binary_search(arr, arr + m, make_pair(ans[np - 1], i))) {
      swap(ans[np], ans[np - 1]);
      np--;
    }
  }
  for (int i = 0; i < n; i++) cout << ans[i] + 1 << " ";
  cout << endl;
  return 0;
}
