#include <bits/stdc++.h>
using namespace std;

ifstream fin("sortaret.in");
ofstream fout("sortaret.out");

vector < int > edges[100001];
stack < int > L;
int n, m, x, y;
bool vizitat[100001];

void dfs(int nod) {
  vizitat[nod] = true;

  for (auto i: edges[nod])
    if (!vizitat[i]) {
      vizitat[i] = 1;
      dfs(i);
    }

  L.push(nod);
}
int main() {
  fin >> n >> m;
  for (int i = 1; i <= m; i++) {
    fin >> x >> y;
    edges[x].push_back(y);
  }

  for (int i = 1; i <= n; i++)
    if (!vizitat[i])
      dfs(i);

  while (!L.empty()) {
    fout << L.top() << " ";
    L.pop();
  }
}