#include <bits/stdc++.h>
using namespace std;
unordered_set<int> e[30005];
int main() {
  int n, m;
  scanf("%d%d", &n, &m);
  for (int i = 0; i < m; i++) {
    int x, y;
    scanf("%d%d", &x, &y);
    e[x].insert(y);
  }
  list<int> ans;
  ans.push_back(1);
  ans.push_back(0);
  for (int i = 2; i <= n; i++) {
    auto t = ans.begin();
    while (e[i].count(*t)) ++t;
    ans.insert(t, i);
  }
  int c = 0;
  for (int x : ans) {
    if (!x) break;
    printf(" %d" + !c++, x);
  }
  puts("");
}
