#include <fstream>
#include <vector>
#include <algorithm>

using namespace std;

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

int vis[50005], gr[50005];

void dfs(int x){
  vis[x] = 1;
  for(int i = 0;  i < graph[x].size(); ++i)
    if(!vis[graph[x][i]])
      dfs(graph[x][i]);
  ans.push_back(x);
}

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

  int n, m;
  in >> n >> m;

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

  for(int i = 1; i <= n; ++i)
    if(gr[i] == 0)
      dfs(i);

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

  return 0;
}