#include <bits/stdc++.h>

using namespace std;

void dfs(int node, vector<int> adj[], vector<int> &postorder, vector<bool> &visited) {
    visited[node] = true;

    for (int neighbor : adj[node])
        if (!visited[neighbor])
            dfs(neighbor, adj, postorder, visited);

    postorder.push_back(node);
}

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

    int n, m, i, x, y;
    fin >> n >> m;

    vector<int> adj[n + 1];
    while (m--) {
        fin >> x >> y;
        adj[x].push_back(y);
    }

    vector<int> postorder;
    vector<bool> visited(n + 1, false);
    for (i = 1; i <= n; i++)
        if (!visited[i])
            dfs(i, adj, postorder, visited);

    for (auto it = postorder.rbegin(); it != postorder.rend(); it++)
        fout << *it << " ";

    return 0;
}