#include <fstream>
#include <vector>
#include <queue>
using namespace std;
int nr[50005];
vector<int> v[50005];
queue<int> q;

int main()
{
    ifstream in("sortaret.in");
    ofstream out("sortaret.out");
    int n, m, x, y;
    in >> n >> m;
    for(int i = 1; i <= m; ++i) {
      in >> x >> y;
      v[x].push_back(y);
      ++nr[y];
    }
    for(int i = 1; i <= n; ++i)
      if(nr[i] == 0) q.push(i);
    for(int i = 1; i <= n; ++i) {
      x = q.front();
      out << x << " ";
      q.pop();
      for(int j = 0; j < v[x].size(); ++j) {
         --nr[v[x][j]];
         if(nr[v[x][j]] == 0) q.push(v[x][j]);
      }
    }
    while(!q.empty()) {
      out << q.front() << " ";
      q.pop();
    }
    return 0;
}