#include "bits/stdc++.h"
// Begin Header {{{
#define all(x) (x).begin(), (x).end()
#define rep(i, s, n) for (i64 i = (s), i##_limit = (n); i < i##_limit; ++i)
#define repr(i, s, t) for (i64 i = (s), i##_limit = (t); i >= i##_limit; --i)
#define repc(i, s, t) for (i64 i = (s), i##_limit = (t); i <= i##_limit; ++i)
#define var(type, ...) \
    type __VA_ARGS__;  \
    read(__VA_ARGS__);
#ifndef DBG
#define dump(...)
#endif
using namespace std;
using i64 = int_fast64_t;
using pii = pair<i64, i64>;
template <class T, class U>
inline bool chmax(T &a, const U &b) {
    return b > a && (a = b, true);
}
template <class T, class U>
inline bool chmin(T &a, const U &b) {
    return b < a && (a = b, true);
}
constexpr int INF = 0x3f3f3f3f;
constexpr i64 LINF = 0x3f3f3f3f3f3f3f3fLL;

template <class T>
inline vector<T> makeV(const T &initValue, size_t sz) {
    return vector<T>(sz, initValue);
}

template <class T, class... Args>
inline auto makeV(const T &initValue, size_t sz, Args... args) {
    return vector<decltype(makeV<T>(initValue, args...))>(
        sz, makeV<T>(initValue, args...));
}

template <class T>
inline istream &operator>>(istream &is, vector<T> &vec) {
    for (auto &e : vec) is >> e;
    return is;
}

inline void read() {}

template <class Head, class... Tail>
inline void read(Head &head, Tail &... tail) {
    cin >> head;
    read(tail...);
}

inline void print() { cout << "\n"; }

template <class Head, class... Tail>
inline void print(Head &&head, Tail &&... tail) {
    cout << head;
    if (sizeof...(tail)) cout << ' ';
    print(forward<Tail>(tail)...);
}

template <class T>
inline ostream &operator<<(ostream &os, const vector<T> &vec) {
    static constexpr const char *delim[] = {" ", ""};
    for (const auto &e : vec) os << e << delim[&e == &vec.back()];
    return os;
}

template <class Container>
struct Rev {
    Container &x_;
    inline Rev(Container &x) : x_(x) {}
    inline auto begin() { return rbegin(x_); }
    inline auto end() { return rend(x_); }
};
// }}} End Header

int N, M;
vector<vector<int>> G;
vector<int> indegCnt;
vector<int> depth;
vector<int> parent;
vector<int> topoOrd;

void detectParent(int v) {
    for (const int child : G[v]) {
        if (depth[child] == depth[v] + 1) {
            parent[child] = v;
            detectParent(child);
        }
    }
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.setf(ios_base::fixed);
    cout.precision(12);

    read(N, M);
    M += N - 1;

    G.resize(N);
    indegCnt.resize(N);
    depth.resize(N);
    parent.resize(N);

    rep(i, 0, M) {
        var(int, a, b);
        --a, --b;
        G[a].push_back(b);
        indegCnt[b]++;
    }

    const int root = find(all(indegCnt), 0) - begin(indegCnt);
    {
        stack<int> S;
        S.push(root);
        topoOrd.reserve(N);

        while (!S.empty()) {
            const int u = S.top();
            S.pop();
            topoOrd.push_back(u);
            for (const int v : G[u]) {
                if (--indegCnt[v] == 0) S.push(v);
            }
        }
    }
    dump(root);
    dump(topoOrd);

    depth[root] = 0;
    for (const int v : topoOrd) {
        for (const int child : G[v]) {
            chmax(depth[child], depth[v] + 1);
        }
    }

    parent[root] = -1;
    detectParent(root);

    for (int p : parent) print(p + 1);

    return 0;
}


Measured memory_bytes: 15020