#include <bits/stdc++.h>

using namespace std;

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

    int N; fin >> N;
    int M; fin >> M;
    vector<vector<int>> adj(N + 1, vector<int>());
    vector<int> in_degrees(N + 1);
    for (int i = 1; i <= M; ++i) {
        int x; fin >> x;
        int y; fin >> y;
        adj[x].push_back(y);
        in_degrees[y]++;
    }

    queue<int> q;
    for (int i = 1; i <= N; ++i) {
        if (in_degrees[i] == 0) q.push(i);
    }
    while (!q.empty()) {
        int u = q.front();
        fout << u << ' ';
        q.pop();

        for (int v : adj[u]) {
            --in_degrees[v];
            if (in_degrees[v] == 0) {
                q.push(v);
            }
        }
    }

    return 0;
}