#include <vector>
 #include <fstream>
 #include <cstdlib>
 #include <iterator>
 #include <algorithm>
 #define N_MAX 50011

 using namespace std;
 bool was[N_MAX];
 vector< int > sT;
 vector< int > G[N_MAX];
 inline void DFS( int x )
 {
     was[x]=true;
     vector< int >::const_iterator it=G[x].begin(), iend=G[x].end();
     for( ; it < iend; ++it )
        if( 0 == was[*it] )
            DFS(*it);
     sT.push_back(x);
 }
 int main( void )
 {
     int N, M, x, y;
     ifstream in( "sortaret.in" );
     for( in>>N>>M; M; --M )
     {
         in>>x>>y;
         G[x].push_back(y);
     }
     for( x=1; x <= N; ++x )
        if( false == was[x] )
            DFS(x);
     ofstream out( "sortaret.out" );
     copy( sT.rbegin(), sT.rend(), ostream_iterator<int>( out, " ") );
     out<<'\n';
     return EXIT_SUCCESS;
 }