#include <vector>
#include <fstream>
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
vector <int> v[50009];
int i, n, d[50009], k, sol[50009], m, x, y;
void dfs(int nod){
  d[nod] = 1;
  for(int i = 0; i<v[nod].size(); i++)
    if(!d[v[nod][i]])
      dfs(v[nod][i]);
  sol[++k]=nod;
}
int main(){
  f>>n>>m;
  for(i = 1; i <= m; i++){
    f>>x>>y;
    v[x].push_back(y);
  }
  for(i = 1; i <= n; i++)
    if(!d[i])
      dfs(i);
  for(i = n; i >= 1; i--)
    g<<sol[i]<<" ";
}