#include <bits/stdc++.h>

using namespace std;
ifstream in("sortaret.in");
ofstream out("sortaret.out");

int n, m, x, y;
int main() {
    in >> n >> m;

    vector<vector<int>> adj(n + 1, vector<int>());
    vector<int> deg(n + 1, 0);

    for (int i = 1; i <= m; i++) {
        in >> x >> y;
        adj[x].push_back(y);

        deg[y]++;
    }

    queue<int> q;
    for (int i = 1; i <= n; i++)
        if (deg[i] == 0) {
            q.push(i);
        }

    while (!q.empty()) {
        int node = q.front();
        q.pop();
        out << node << ' ';

        for (auto it : adj[node]) {
            deg[it]--;
            if (deg[it] == 0) {
                q.push(it);
            }
        }
    }
    return 0;
}