#include <iostream>
#include <fstream>
#include <vector>
#include <cstring>

using namespace std;
#define oo 0x3f3f3f3f

ifstream f("sortaret.in");
ofstream g("sortaret.out");
int n, m;
vector<int> graf[50001];
vector<int> topo;
bool viz[50001];

void read() {
  f>>n>>m;
  int x, y;
  for(int i = 0;i < m;++i) {
    f>>x>>y;
    graf[x].push_back(y);
  }
  f.close();
}

void dfs(const int& node) {
  if(viz[node]) {
    return;
  }
  viz[node] = true;
  for(const auto& ngh : graf[node]) {
    dfs(ngh);
  }

  topo.push_back(node);
}

void solve() {
  memset(viz, false, sizeof(viz));
  for(int i = 1;i <= n;++i) {
    if(!viz[i]) {
      dfs(i);
    }
  }
  for(auto it = topo.rbegin();it != topo.rend();++it) {
    g<<*it<<" ";
  }
  g.close();
}

int main() {
  read();
  solve();
  return 0;
}