#include <iostream>
#include <fstream>
#include <vector>
#define MAX 50010

using namespace std;

int n,m,sz,x,y;
int ans[MAX];
bool acc[MAX];
vector<int> nd[MAX];
void dfs(int nod){
  acc[nod]=1;
  for(auto i:nd[nod])
    if(!acc[i]) dfs(i);
  ans[++sz]=nod;
}

int main()
{
    ifstream f ("sortaret.in");
    ofstream g ("sortaret.out");
    f>>n>>m;
    for(int i=1;i<=m;i++)
      f>>x>>y,
      nd[x].push_back(y);
    for(int i=1;i<=n;i++)
      if(!acc[i])
        dfs(i);
    for(int i=sz;i;i--)g<<ans[i]<<" ";
    f.close ();
    g.close ();
    return 0;
}