#include <fstream>
#include <vector>
#include <algorithm>
#define f in
#define g out

using namespace std;
ifstream in ( "sortaret.in" );
ofstream out( "sortaret.out" );
int n, m, x, y, i, k;
int v[50009], fr[50009];
vector<int>L[50009];

void dfs ( int nod ){
    fr[nod] = 1;
    for ( int i = 0; i < L[nod].size(); i++ ){
        int vecin = L[nod][i];
        if ( !fr[vecin] )
            dfs( vecin );
    }
    v[++k] = nod;
}

int main() {
    f>>n>>m;
    for ( i=1; i <= m; i++ ){
        f>>x>>y;
        L[x].push_back(y);
    }
    for ( i=1; i <= n; i++ )
        sort ( L[i].begin(), L[i].end() );
    for ( i=1; i <= n; i++ )
        if ( !fr[i] )
            dfs ( i );
    for ( i=n; i; i-- )
        g<<v[i]<<" ";
    return 0;
}