//
// Created by Cristian Constantin on 20.05.2024.
//
#include <iostream>
#include <fstream>
#include <vector>
#include <queue>

int main() {
    using namespace std;

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

    int n, m;
    fin >> n >> m;

    vector<vector<int>> adjList(n);
    vector<int> inDegree(n, 0);

    for (int i = 0; i < m; ++i) {
        int u, v;
        fin >> u >> v;
        --u; --v;
        adjList[u].push_back(v);
        inDegree[v]++;
    }

    priority_queue<int, vector<int>, greater<int>> minHeap;

    for (int i = 0; i < n; ++i) {
        if (inDegree[i] == 0) {
            minHeap.push(i);
        }
    }

    while (!minHeap.empty()) {
        int node = minHeap.top();
        minHeap.pop();
        fout << node + 1 << " ";

        for (int neighbor : adjList[node]) {
            if (--inDegree[neighbor] == 0) {
                minHeap.push(neighbor);
            }
        }
    }

    return 0;
}