#include <bits/stdc++.h>
using namespace std;
const long long mx = 2e5 + 7;
void solve() {
  long long n, m;
  cin >> n >> m;
  vector<set<long long>> vs(n + 1);
  for (long long i = 0; i < m; i++) {
    long long a, b;
    cin >> a >> b;
    vs[a].insert(b);
  }
  vector<long long> ans(n + 1);
  for (long long i = 1; i <= n; i++) {
    ans[i] = i;
    long long cur = i - 1;
    while (cur >= 1 && vs[ans[cur]].find(ans[cur + 1]) != vs[ans[cur]].end()) {
      swap(ans[cur], ans[cur + 1]);
      cur--;
    }
  }
  for (long long i = 1; i <= n; i++) cout << ans[i] << " ";
  cout << "\n";
}
signed main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long t = 1, n;
  while (t--) {
    solve();
  }
  return 0;
}
