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

using namespace std;

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

vector <int> graph[100005];
int visited[100005], n, x, y, nr, i, m;
vector <int> topo;

void dfs ( int node ) {
    visited[node] = 1;
    for ( auto j: graph[node] ) {
        if ( visited[j] == 0 ) {
            dfs ( j );
        }
    }
    topo.push_back ( node );
}

int main() 
{
    fin >> n >> m;

    for ( i = 1; i <= m; i++ ) {
        fin >> x >> y;
        graph[x].push_back(y);
    }
    for ( i = 1; i <= n; i++ ) {
        if ( visited[i] == 0 ) {
            dfs ( i );
        }
    }

    reverse ( topo.begin(), topo.end() );

    for ( auto i: topo ) {
        fout << i << ' ';
    }
    
    return 0;
}