#include <bits/stdc++.h>
using ll = long long;
const ll mod = 998244353;
const ll N = 3e5 + 5;
const int base = 400;
using ull = unsigned long long;
using namespace std;
ll n, m, t, k, T, a[N], dp[N], lab[N], u, v, b[N], d[N], tong, cnt, q, fe[N],
    ans, num[N], low[N];
vector<ll> adj[N], pre, kq;
vector<pair<ll, ll> > adt[N];
set<ll> st[N];
void add(ll id, ll val) {
  for (; id <= n; id += id & -id) fe[id] += val;
}
ll get(ll id) {
  ll total = 0;
  for (; id; id -= id & -id) total += fe[id];
  return total;
}
bool ok;
void taj(ll u, ll p) {
  pre.push_back(u);
  num[u] = low[u] = ++k;
  b[u] = 1;
  for (ll v : adj[u]) {
    if (num[v])
      low[u] = min(low[u], num[v]);
    else {
      taj(v, u);
      low[u] = min(low[u], low[v]);
    }
  }
  if (num[u] == low[u]) {
    ll v;
    do {
      v = pre.back();
      kq.push_back(v);
      num[v] = low[v] = mod;
      pre.pop_back();
    } while (v != u);
  }
  b[u] = 2;
}
void sol() {
  cin >> n >> m;
  for (int i = 1; i <= m; i++) {
    cin >> u >> v;
    st[u].insert(v);
  }
  kq.push_back(1);
  for (int i = 2; i <= n; i++) {
    kq.push_back(i);
    int j = i - 2;
    while (j >= 0 && st[kq[j]].find(kq[j + 1]) != st[kq[j]].end()) {
      swap(kq[j], kq[j + 1]);
      --j;
    }
  }
  for (ll x : kq) cout << x << " ";
}
int main() {
  if (fopen("pieaters"
            ".inp",
            "r")) {
    freopen(
        "pieaters"
        ".inp",
        "r", stdin);
    freopen(
        "pieaters"
        ".out",
        "w", stdout);
  }
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int ntest;
  ntest = 1;
  while (ntest-- > 0) sol();
}
