#include <iostream>
#include <fstream>
#include <vector>

using namespace std;

const int NMAX = 5e4;

vector <int> v[NMAX + 1];
bool vizitat[NMAX + 1];

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

void dfs( int nod ) {

    vizitat[nod] = 1;
    for ( auto it: v[nod]) {
        if ( !vizitat[it] )
            dfs( it );
    }
    fout << nod << ' ';
}
int main() {
    int n, i, m, a, b;
    fin >> n >> m;
    for ( i = 0; i < m; i ++ ) {
        fin >> a >> b;
        v[b].push_back( a );
    }
    for ( i = 1; i <= n; i ++ ) {
        if ( !vizitat[i] )
            dfs( i );
    }
    return 0;
}