// Folositi neovim pls
#include <bits/stdc++.h>

using namespace std;

std::ifstream fin("sortaret.in");
std::ofstream fout("sortaret.out");
int n, m;
std::vector<std::vector<int>> gf;
std::vector<bool> visited;
std::vector<int> topologicSort;

int verify() {
    for (int i = 1; i <= n; ++i)
        if (!visited[i]) return i;
    return -1;
}

void dfs(int node, std::vector<int>& nodesToAdd) {
    visited[node] = true;
    nodesToAdd.push_back(node);
    for (const auto& nextNode : gf[node]) {
        if (!visited[nextNode]) // While not visited
            dfs(nextNode, nodesToAdd);
    }
}

int main() {
    fin >> n >> m;
    gf.resize(n + 1);
    visited.resize(n + 1, false);
    
    for (int i = 0; i < m; ++i) {
        int x, y;
        fin >> x >> y;
        gf[x].push_back(y);
    }

    int indexSort = n;
    int nodeNeparcurs = verify();
    while (nodeNeparcurs != -1) { // While there are unvisited nodes
        std::vector<int> nodesToAdd;
        dfs(nodeNeparcurs, nodesToAdd);
        // Now add them in reverse order
        for (int i = nodesToAdd.size() - 1; i >= 0; --i) {
            topologicSort.push_back(nodesToAdd[i]);
        }
        nodeNeparcurs = verify(); // Check for the next unvisited node
    }

    // Print the topological sort
    for (int i = topologicSort.size() - 1; i >= 0; --i) {
        fout << topologicSort[i] << " ";
    }
    
    return 0;
}