#include <fstream>
#include <vector>
#include <bitset>
#include <deque>

using namespace std;

ifstream cin("sortaret.in");
ofstream cout("sortaret.out");

int n, m;
vector<int> graph[50005];
bitset<50005> visited;
deque<int> Q;

void DFS(int start) {

    //cout << start << ' ' ;

    visited[start] = true;

    for (auto it: graph[start]) {

        if (!visited[it])
            DFS(it);

    }

    Q.push_back(start);

}

int main() {

    int x, y;

    cin >> n >> m;

    for (int i = 0 ; i < m ; i++)
        cin >> x >> y, graph[x].push_back(y);

    for (int i = 1 ; i <= n ; ++i)
        if (!visited[i])
            DFS(i);


    while (!Q.empty())
        cout << Q.back() << ' ', Q.pop_back();


    return 0;
}