#include <fstream>
#include <vector>

constexpr int kMaxN = 50000;

int n, m;
std::vector<int> edges[kMaxN+1];
bool visited[kMaxN+1];
std::vector<int> reversed_topological_order;

void dfs(int x) {
    visited[x] = true;
    for(int y : edges[x]) {
        if(!visited[y]) dfs(y);
    }
    reversed_topological_order.push_back(x);
}

int main()
{
    std::ifstream in("sortaret.in");
    std::ofstream out("sortaret.out");
    in>>n>>m;
    for(int x, y, i = 1; i <= n; ++i) {
        in>>x>>y;
        edges[x].push_back(y);
    }
    for(int i = 1; i <= n; ++i) {
        if(!visited[i]) dfs(i);
    }
    for(auto it = reversed_topological_order.rbegin(); it != reversed_topological_order.rend(); ++it) {
        out<<*it<<' ';
    }
    return 0;
}