#include <iostream>
#include <fstream>
#include <vector>
#include <stack>
using namespace std;

ifstream f("sortaret.in");
ofstream of("sortaret.out");

vector< vector<int> > lista;
vector<bool> viz;
stack<int> stiva;

void topsort(int nod) {
    viz[ nod ] = 1;
    for(int j = 0; j < lista[nod].size(); j++)
        if( !viz[ lista[nod][j] ] )
            topsort( lista[nod][j] );
    stiva.push( nod );
}

int main()
{
    int n, i, j, m, k;
    f >> n >> m;

    lista.assign( n + 1, vector<int>() );
    viz.assign( n + 1, 0 );

    for(k = 0; k < m; k++) {
        f >> i >> j;
        lista[i].push_back( j );
    }

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

    while( !stiva.empty() ) {
        of << stiva.top() << " ";
        stiva.pop();
    }

    return 0;
}