#include <fstream>
#include <vector>

using namespace std;

const int N = 50005;

vector<int> gr[N], top;
bool viz[N];

void dfs(int nod) {
  viz[nod] = true;
  for (auto vec : gr[nod])
    if (!viz[vec])
      dfs(vec);
  top.push_back(nod);
}

int main() {
  ifstream cin("sortaret.in");
  ofstream cout("sortaret.out");
  int n, m;
  cin >> n >> m;
  while (m--) {
    int x, y;
    cin >> x >> y;
    gr[x].push_back(y);
  }
  cin.close();
  for (int i = 1; i <= n; ++i)
    if (!viz[i])
      dfs(i);
  for (int i = top.size() - 1; i >= 0; --i)
    cout << top[i] << " ";
  cout.close();
  return 0;
}