#include <fstream>
#include <vector>
#include <stack>

using namespace std;
ifstream fin ("sortaret.in");
ofstream fout ("sortaret.out");

int n, m, viz[50005], s[50005];

vector <int> g[50005];
stack <int> stiva;

void topsort ( int nod ) {

    viz[nod] = 1;

    for ( unsigned i = 0; i < g[nod].size(); i++ )
        if ( !viz[ g[nod][i] ] )
           topsort ( g[nod][i] );

    stiva.push( nod );
}

int main()
{
    int x, y;
    fin >> n >> m;

    for ( int i = 1; i <= m; i++ ) {
        fin >> x >> y;
        g[x].push_back(y);
    }

    for ( int i = 1; i <= n; i++ )
        if ( !viz[i] )
            topsort( i );

    for ( int i = 1; i <= n; i++ ) {
        s[i] = stiva.top();
        stiva.pop();
        fout << s[i] << " ";
    }
    return 0;
}