#include <bits/stdc++.h>
using namespace std;
template <typename T>
void _do(T x) {
  cerr << x << "\n";
}
template <typename T, typename... U>
void _do(T x, U... y) {
  cerr << x << ", ";
  _do(y...);
}
const int MOD1 = 1e9 + 7;
const int MOD2 = 998244353;
const long long INF = 3e18;
const long double PI = 3.14159265358979323846;
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long fpow(long long a, long long b, long long m) {
  if (!b) return 1;
  long long ans = fpow(a * a % m, b / 2, m);
  return (b % 2 ? ans * a % m : ans);
}
long long inv(long long a, long long m) { return fpow(a, m - 2, m); }
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  long long n, m;
  set<pair<long long, long long> > s;
  cin >> n >> m;
  for (long long i = 1; i <= m; i++) {
    long long u, v;
    cin >> u >> v;
    s.insert({u, v});
  }
  vector<long long> ans;
  for (long long i = 1; i <= n; i++) {
    ans.push_back(i);
    for (long long j = i - 1; j >= 1; j--) {
      if (!s.count({ans[j - 1], ans[j]})) break;
      swap(ans[j - 1], ans[j]);
    }
  }
  for (long long u : ans) cout << u << " ";
}
