#include <fstream>
#include <vector>
#include <queue>

using namespace std;

vector<int> graph[50005];
vector<int> ans;
int deg[50005];

int main(){
  ifstream in("sortaret.in");

  int n, m;

  in >> n >> m;

  for(int i = 1; i <= m; ++i){
    int x, y;
    in >> x >> y;
    ++deg[y];
    graph[x].push_back(y);
  }

  queue<int> q;
  for(int i = 1; i <= n; ++i)
    if(deg[i] == 0)
      q.push(i);

  while(!q.empty()){
    int now = q.front();
    q.pop();
    ans.push_back(now);
    for(int i = 0; i < graph[now].size(); ++i){
      --deg[graph[now][i]];
      if(deg[graph[now][i]] == 0)
        q.push(graph[now][i]);
    }
  }

  ofstream out("sortaret.out");

  for(int i = 0; i < ans.size(); ++i)
    out << ans[i] << " ";

  return 0;
}