#include <bits/stdc++.h>

using namespace std;

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

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

    int x, y;
    std::vector<int> g(n, 0);
    std::vector<std::vector<int>> adj(n, std::vector<int>());
    for (int i = 0; i < m; i++) {
        in >> x >> y;
        x--;
        y--;
        g[y]++;
        adj[x].push_back(y);
    }

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

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

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