#include <bits/stdc++.h>
using namespace std;
const int N = 30005;
vector<int> G[N];
bool ok[N];
int n, m;
vector<int> ans;
void dfs(int u) {
  ok[u] = 1;
  for (auto v : G[u]) {
    if (!ok[v]) {
      dfs(v);
    }
  }
  ans.push_back(u);
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cin >> n >> m;
  for (int i = 1; i <= m; ++i) {
    int u, v;
    cin >> u >> v;
    G[v].push_back(u);
  }
  for (int i = 1; i <= n; ++i)
    if (!ok[i]) dfs(i);
  reverse(ans.begin(), ans.end());
  for (int i = 0; i < ans.size(); ++i) cout << ans[i] << ' ';
}
