#include <bits/stdc++.h>
using namespace std;
const int mxn = 3e4 + 5;
int n, m, a, b;
vector<int> adj[mxn], ans;
bool mark[mxn];
void dfs(int v) {
  mark[v] = 1;
  for (auto u : adj[v]) {
    if (!mark[u]) {
      dfs(u);
    }
  }
  cout << v << " ";
}
int main() {
  cin >> n >> m;
  while (m--) {
    cin >> a >> b;
    adj[a].push_back(b);
  }
  for (int i = 1; i <= n; i++) {
    if (!mark[i]) dfs(i);
  }
  return 0;
}
