#include <fstream>
#include <vector>
#include <queue>


using namespace std;

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

    int n, m;
    cin >> n >> m;
    vector<vector<int>> graph(n + 1);
    vector<int> in_degree(n + 1, 0);
    queue<int> q;

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

    for (int i = 1; i <= n; i++) {
        if (!in_degree[i])
            q.push(i);
    }

    vector<int> order;
    while (!q.empty()) {
        int node = q.front();
        q.pop();

        for (auto next : graph[node]) {
            in_degree[next]--;
            if (!in_degree[next])
                q.push(next);
        }

        order.push_back(node);
    }

    if (order.size() != n)
        return 0;
    
    for (auto node : order) {
        cout << node << " ";
    }

    return 0;
}