#include <fstream>
#include <vector>

using namespace std;

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

const int nmax = 500000;

int n, m;
int x, y;

vector < vector <int> > g(1 + nmax);
vector <int> nodes;

int viz[1 + nmax];

void dfs(int nod) {
  viz[nod] = 1;
  for(int i = 0; i < g[nod].size(); i++)
    if(viz[g[nod][i]] == 0)
      dfs(g[nod][i]);
  viz[nod] = 2;
  nodes.push_back(nod);
}

int main() {
  cin >> n >> m;
  for(int i = 1; i <= m; i++) {
    cin >> x >> y;
    g[x].push_back(y);
  }
  for(int i = 1; i <= n; i++)
    if(viz[i] == 0)
      dfs(i);
  for(int i = nodes.size() - 1; i >= 0; i--)
    cout << nodes[i] << " ";
  return 0;
}