#include <bits/stdc++.h>

#define FOR(i,a,b) for(int i= (a); i<((int)b); ++i)
#define RFOR(i,a) for(int i=(a); i >= 0; --i)
#define FOE(i,a) for(auto i : a)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
#define DUMP(x)  cerr << #x << " = " << (x) << endl;
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v,x) (std::find(v.begin(), v.end(), x) != v.end())
#define BIT_ON(bit, i) (((bit >> i) & 1) > 0)

typedef long long LL;
template<typename T> std::vector<T> make_v(size_t a){return std::vector<T>(a);}
template<typename T,typename... Ts> auto make_v(size_t a, Ts... ts){ return std::vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));}    // C++14
template<typename T,typename V> typename std::enable_if<std::is_class<T>::value==0>::type fill_v(T &t,const V &v){t=v;}
template<typename T,typename V> typename std::enable_if<std::is_class<T>::value!=0>::type fill_v(T &t,const V &v){for(auto &e:t) fill_v(e,v);}
template<class T> inline T ceil(T a, T b) { return (a + b - 1) / b; }
template<class T> inline void print(T x) { std::cout << x << std::endl; }
template<class T> inline void print_vec(const std::vector<T> &v) { for (int i = 0; i < v.size(); ++i) {  if (i != 0) {std::cout << " ";} std::cout << v[i];} std::cout << "\n"; }
template<class T> inline bool inside(T y, T x, T H, T W) {return 0 <= y and y < H and 0 <= x and x < W; }
template<class T> inline double euclidean_distance(T y1, T x1, T y2, T x2) { return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2)); }
template<class T> inline double manhattan_distance(T y1, T x1, T y2, T x2) { return abs(x1 - x2) + abs(y1 - y2); }
template<typename T> T &chmin(T &a, const T &b) { return a = std::min(a, b); }
template<typename T> T &chmax(T &a, const T &b) { return a = std::max(a, b); }

template<class T> inline std::vector<T> unique(std::vector<T> v) {
    sort(v.begin(), v.end());
    v.erase(unique(v.begin(), v.end()), v.end());
    return v;
}
// 初項s, 交差dのn個の数列の和
long long sum_of_arithmetic_progression(long long s, long long d, long long n) {
    return n * (2 * s + (n - 1) * d) / 2;
}

// 2のべき乗数かどうか
bool is_power_of_two(long long x) {
    return !(x & (x - 1));
}

// aとbの最大公約数 O(log min(a, b))
long long gcd(long long a, long long b) {
    if (b == 0) { return a; }
    return gcd(b, a % b);
}

// 数列vの最大公約数 O(N log d)
long long gcd(std::vector<long long> &v) {
    long long ans = v[0];
    for (int i = 1; i < v.size(); ++i) {
        ans = gcd(ans, v[i]);
    }
    return ans;
}

// aとbの最小公倍数 O(log min(a, b))
long long lcm(long long a, long long b) {
    long long g = gcd(a, b);
    return a / g * b;
}

const int INF = 1 << 30;
const double EPS = 1e-9;
const long double PI = acos(-1.0);
const std::vector<int> dy2 = {0, 1}, dx2 = {1, 0};  // 右，下
const std::vector<int> dy4 = {0, -1, 0, 1}, dx4 = {1, 0, -1, 0};    // 右，上，左，下
const std::vector<int> dy8 = { 0, -1, 0, 1, 1, -1, -1, 1 }, dx8 = { 1, 0, -1, 0, 1, 1, -1, -1 };


using namespace std;

class TopologicalSort {
    const unsigned int N;                        // ノード数
    const std::vector<std::vector<int>> graph;   // グラフ
    std::vector<bool> used;                      // 使用済みノード
    std::vector<int> indeg;                      // 入次数


public:
    std::vector<int> result; // ソート結果

public:
    TopologicalSort(unsigned int num_node, const std::vector<std::vector<int>> &graph) : N(num_node), graph(graph) {
        this->indeg.assign(num_node, 0);
        this->used.assign(num_node, false);
    }

    // 自分から自分にエッジを張る場合に注意(graph[0] = {0, 1, 2, ..}みたいなの)
    bool sort() {
        for (int u = 0; u < N; ++u) {
            for (int v : graph[u]) {
                indeg[v]++;
            }
        }

        for (int u = 0; u < N; ++u) {
            if (indeg[u] == 0 and not used[u]) {
                bfs(u);
            }
        }

        return this->result.size() == N;
    }

private:
    void bfs(int s) {
        std::queue<int> que;
        que.push(s);
        used[s] = true;
        while (not que.empty()) {
            int u = que.front();
            que.pop();
            result.emplace_back(u);

            for (int v : graph[u]) {
                indeg[v]--;
                if (indeg[v] == 0 and not used[v]) {
                    used[v] = true;
                    que.push(v);
                }
            }
        }
    }
};


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

    int N, M;
    cin >> N >> M;

    auto graph = make_v<int>(N, 0);
    auto graph2 = make_v<int>(N, 0);
    unordered_map<int, int> ingree, degree;
    FOR(i, 0, N - 1 + M) {
        int A, B;
        cin >> A >> B;
        A--; B--;
        graph[A].emplace_back(B);
        graph2[B].emplace_back(A);
        ingree[A]++;
        degree[B]++;
    }

    TopologicalSort ts(N, graph);
    ts.sort();

    auto pos = make_v<int>(N);
    FOR(i, 0, N) {
        pos[ts.result[i]] = i;
    }

    int root = -1;
    FOR(i, 0, N) {
        if (degree[i] == 0) {
            root = i;
            break;
        }
    }

    queue<int> que;
    FOR(i, 0, N) {
        if (ingree[i] == 0) {
            que.emplace(i);
        }
    }
    auto parent = make_v<int>(N);
    fill_v(parent, -1);

    while (not que.empty()) {
        const int u = que.front(); que.pop();
        if (u == root) {
            continue;
        }

        int p = -1;
        int dist = -1;
        FOE(v, graph2[u]) {
            if (pos[v] > dist) {
                dist = pos[v];
                p = v;
            }
        }
        parent[u] = p;
        que.emplace(p);
    }

    FOR(i, 0, parent.size()) {
        print(parent[i] + 1);
    }


    return 0;
}

Measured memory_bytes: 27080