#include <iostream>
#include <fstream>
#include <vector>
#include <bitset>
#include <stack>

using namespace std;

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

const int NMAX = 5 * 1e4;

int n, m;

bitset < 1 + NMAX > vis;
vector < int > g[1 + NMAX];
stack < int > st;

void dfs(int node) {
  vis[node] = 1;
  for(int i = 0; i < g[node].size(); i++) {
    int to = g[node][i];
    if(vis[to] == 0)
      dfs(to);
  }

  st.push(node);
}

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

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

  while(!st.empty()) {
    out << st.top() << ' ';
    st.pop();
  }

  out << '\n';

  in.close();
  out.close();
  return 0;
}