/**
 * Code by Patrick Sava
 * "Spiru Haret" National College of Bucharest
 **/

# include "fstream"
# include "cstring"
# include "vector"
# include "queue"
# include "bitset"
# include "algorithm"
# include "map"
# include "unordered_map"
# include "deque"
# include "string"
# include "iomanip"
# include "cmath"
# include "stack"
# include "cassert"

const char IN [ ] =  "sortaret.in" ;
const char OUT [ ] = "sortaret.out" ;
const int MAX = 100999 ;

# define pb push_back
# define mp make_pair
# define FORN( a , b , c ) for ( int a = b ; a <= c ; ++ a )
# define FORNBACK( a , b , c ) for ( int a = b ; a >= c ; -- a )

using namespace std ;

ifstream cin ( IN ) ;
ofstream cout ( OUT ) ;

vector < int > gr [ MAX ] ;

queue < int > Q ;

int grad [ MAX ] ;

int main()
{
    int n , m ;
    cin >> n >> m ;

    while ( m -- )
    {
        int x , y ;
        cin >> x >> y ;
        gr [ x ].pb ( y ) ;
        grad [ y ] ++ ;
    }

    FORN ( i , 1 , n )
        if ( grad [ i ] == 0 )
        {
            Q.push ( i ) ;
        }

    while ( !Q.empty() )
    {
        int nod = Q.front() ;
        Q.pop() ;

        for ( auto x : gr [ nod ] )
        {
            grad [ x ] -- ;
            if ( grad [ x ] == 0 ) Q.push( x ) ;
        }

        cout << nod << ' ' ;
    }


    return 0;
}