#include <cstdio>
#include <algorithm>
#include <vector>
#include <stack>
using namespace std;

#define Nmax 50002

FILE *f = fopen ( "sortaret.in", "r" );
FILE *g = fopen ( "sortaret.out", "w" );

vector < int > G[Nmax];
stack < int > sol;
bool viz[Nmax];

void DFS ( int nod ){

    viz[nod] = 1;

    vector < int > :: iterator it;

    for ( it = G[nod].begin(); it < G[nod].end(); ++it ){
        if ( !viz[*it] )
            DFS ( *it );
    }
    sol.push ( nod );
}

int main(){

    int N, M, x, y;
    vector < int > :: iterator it;

    fscanf ( f, "%d%d", &N, &M );

    for ( int i = 1; i <= M; ++i ){
        fscanf ( f, "%d%d", &x, &y );
        G[x].push_back ( y );
    }

    for ( int i = 1; i <= N; ++i )
        if ( !viz[i] )
            DFS ( i );

    while ( !sol.empty() ){
        fprintf ( g, "%d ", sol.top() );
        sol.pop();
    }

    return 0;
}