#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100 * 1000;
vector<int> a[MAXN], ans;
bool mark[MAXN];
void dfs(int v) {
  mark[v] = true;
  for (auto u : a[v]) {
    if (!mark[u]) dfs(u);
  }
  cout << v << ' ';
}
int main() {
  int n, m;
  cin >> n >> m;
  for (int i = 0, x, y; i < m; i++) {
    cin >> x >> y;
    a[x].push_back(y);
  }
  for (int i = 1; i <= n; i++)
    if (!mark[i]) dfs(i);
  return 0;
}
