#include <fstream>
using namespace std;
ifstream f("sortaret.in");ofstream g("sortaret.out");
#include <vector>
#define LE 50666
#define pb push_back
bool viz[LE];
vector<int> G1[LE],G2[LE];
int i,x,y,n,m;

void dfs(int nod){
 int i,N=G2[nod].size();
 if (viz[nod]==true) return;
 for( i=0;i<N;++i) if (viz[G2[nod][i]]==false) return;

 N=G1[nod].size();
 viz[nod]=true; g<<nod<<" ";

 for(i=0;i<N;++i)
   dfs(G1[nod][i]);
}
int main(){
    f>>n>>m;
     for(i=1;i<=m;++i){
       f>>x>>y;
       G1[x].pb(y);G2[y].pb(x);
     }

  for(i=1;i<=n;++i)
    if(viz[i]==false) dfs(i);


f.close();g.close();
    return 0;
}