#include <bits/stdc++.h>
using namespace std;
vector<vector<int>> v;
vector<int> a;
set<pair<int, int>> st;
int main() {
  int n, m;
  scanf("%d%d", &n, &m);
  int a1, b1;
  for (int i = 0; i < m; ++i) {
    scanf("%d%d", &a1, &b1);
    st.insert(pair<int, int>(a1, b1));
  }
  a.resize(n);
  for (int i = 0; i < n; ++i) a[i] = i + 1;
  for (int i = 1; i < n; ++i) {
    while ((i > 0) && (st.count(pair<int, int>(a[i - 1], a[i])) > 0)) {
      swap(a[i], a[i - 1]);
      i--;
    }
  }
  for (int i = 0; i < n; i++) printf("%d ", a[i]);
}
