#include <algorithm>
#include <cassert>
#include <cstdint>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <stack>
#include <unordered_set>
#include <vector>

using namespace std;

template <typename N = std::size_t, typename E = std::size_t>
class SparseGraph
{
public:
    using NodeType = N;
    using EdgeType = E;
    using NeighborListType = std::unordered_set<std::size_t>;

    SparseGraph(bool undirected = true) noexcept
        : undirected_(undirected)
    {
    }

    void push_node(NodeType n) noexcept
    {
        nodes_.push_back(n);
        neighbor_list_.emplace_back();
    }

    void connect(const std::size_t from, const std::size_t to, const EdgeType edge = EdgeType()) noexcept
    {
        if (undirected_)
        {
            neighbor_list_[from].insert(to);
            neighbor_list_[to].insert(from);
            edges_[std::make_pair(std::min(from, to), std::max(from, to))] = edge;
        }
        else
        {
            neighbor_list_[from].insert(to);
            edges_[std::make_pair(from, to)] = edge;
        }
    }

    void disconnect(const std::size_t from, const std::size_t to) noexcept
    {
        if (undirected_)
        {
            neighbor_list_[from].erase(to);
            neighbor_list_[to].erase(from);
            edges_.erase(std::make_pair(std::min(from, to), std::max(from, to)));
        }
        else
        {
            neighbor_list_[from].erase(to);
            edges_.erase(std::make_pair(from, to));
        }
    }

    const NodeType& node(const std::size_t index) const noexcept
    {
        return nodes_.at(index);
    }

    const EdgeType& edge(const std::size_t from, const std::size_t to) const noexcept
    {
        if (undirected_)
        {
            auto key = std::make_pair(std::min(from, to), std::max(from, to));
            return edges_.at(key);
        }
        else
        {
            auto key = std::make_pair(from, to);
            return edges_.at(key);
        }
    }

    NodeType& node(const std::size_t index) noexcept
    {
        return nodes_.at(index);
    }

    EdgeType& edge(const std::size_t from, const std::size_t to) noexcept
    {
        if (undirected_)
        {
            auto key = std::make_pair(std::min(from, to), std::max(from, to));
            return edges_.at(key);
        }
        else
        {
            auto key = std::make_pair(from, to);
            return edges_.at(key);
        }
    }

    const NeighborListType&
    neighbor(const std::size_t index) const noexcept
    {
        return neighbor_list_[index];
    }

    std::size_t size() const noexcept
    {
        return neighbor_list_.size();
    }

private:
    using EdgeMap = std::map<std::pair<std::size_t, std::size_t>, EdgeType>;

    std::vector<NeighborListType> neighbor_list_;

    EdgeMap edges_;

    std::vector<NodeType> nodes_;

    bool undirected_;
};

template <typename GraphType>
std::vector<std::size_t> topological_order(const GraphType& graph)
{
    std::vector<std::size_t> order;
    stack<int> st;

    vector<int> hs(graph.size());

    for (int v = 0; v < graph.size(); v++)
    {
        for (int nv : graph.neighbor(v))
        {
            hs[nv]++;
        }
    }
    for (int i = 0; i < graph.size(); i++)
    {
        if (hs[i] == 0)
        {
            st.push(i);
        }
    }

    vector<int> finished(graph.size(), false);

    while (!st.empty())
    {
        const int v = st.top();
        st.pop();
        order.push_back(v);
        finished[v] = true;

        for (int nv : graph.neighbor(v))
        {
            hs[nv]--;
            if (hs[nv] == 0 && !finished[nv])
            {
                st.push(nv);
            }
        }
    }
    assert(order.size() == graph.size());
    return order;
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n, m;
    cin >> n >> m;

    SparseGraph<> graph(false);
    for (int i = 0; i < n; i++)
    {
        graph.push_node(0);
    }

    vector<int> ts(n, 0);
    for (int i = 0; i < m + n - 1; i++)
    {
        int f, t;
        cin >> f >> t;
        graph.connect(f - 1, t - 1);
        ts[t - 1]++;
    }

    const int root = distance(ts.begin(), find(ts.begin(), ts.end(), 0));
    graph.node(root) = 0;

    auto order = topological_order(graph);
    vector<int> rev(n, 0);
    for (int i = 0; i < n; i++)
    {
        rev[order[i]] = i;
    }

    vector<vector<int>> rev_neighbor(n);

    for (int v : order)
    {
        for (int nv : graph.neighbor(v))
        {
            rev_neighbor[nv].push_back(v);
        }
    }

    for (int i = 1; i < n; i++)
    {
        int v = order[i];
        int selected = 0;
        int max_i = -1;
        for (int rv : rev_neighbor[v])
        {
            if (max_i <= rev[rv])
            {
                max_i = rev[rv];
                selected = rv;
            }
        }
        graph.node(v) = graph.node(selected) + 1;
    }

    vector<int> result(n, -1);
    result[root] = 0;

    for (int v = 0; v < graph.size(); v++)
    {
        for (int nv : graph.neighbor(v))
        {
            if (graph.node(v) + 1 == graph.node(nv))
            {
                result[nv] = v + 1;
            }
        }
    }
    for (auto v : result)
    {
        cout << v << endl;
    }
}

Measured memory_bytes: 28076