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

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