// May this submission get accepted!

#pragma GCC optimize ("O3")
#pragma GCC target ("tune=native")
#pragma GCC target ("avx")

#include <bits/stdc++.h>

// 汎用マクロ
#define ALL_OF(x) (x).begin(), (x).end()
#define REP(i,n) for (long long i=0, i##_len=(n); i<i##_len; i++)
#define RANGE(i,is,ie) for (long long i=(is), i##_end=(ie); i<=i##_end; i++)
#define DSRNG(i,is,ie) for (long long i=(is), i##_end=(ie); i>=i##_end; i--)
#define STEP(i, is, ie, step) for (long long i=(is), i##_end=(ie), i##_step = (step); i<=i##_end; i+=i##_step)
#define UNIQUE(v) do { sort((v).begin(), (v).end()); (v).erase(unique((v).begin(), (v).end()), (v).end()); } while (false)
template<class T> bool chmax(T &a, const T &b) {if (a < b) {a = b; return true;} return false; }
template<class T> bool chmin(T &a, const T &b) {if (a > b) {a = b; return true;} return false; }
#define INF 0x7FFFFFFF
#define LINF 0x7FFFFFFFFFFFFFFFLL
#define Yes(q) ((q) ? "Yes" : "No")
#define YES(q) ((q) ? "YES" : "NO")
#define Possible(q) ((q) ? "Possible" : "Impossible")
#define POSSIBLE(q) ((q) ? "POSSIBLE" : "IMPOSSIBLE")
#define DUMP(q) cerr << "[DEBUG] " #q ": " << (q) << " at " __FILE__ ":" << __LINE__ << endl
#define DUMPALL(q) do { cerr << "[DEBUG] " #q ": ["; REP(i, (q).size()) { cerr << (q)[i] << (i == i_len-1 ? "" : ", "); } cerr << "] at " __FILE__ ":" << __LINE__ << endl; } while (false)
template<class T> T gcd(T a, T b) { if (a < b) std::swap(a, b); while (b) std::swap(a %= b, b); return a; }
template<class T> T lcm(const T a, const T b) { return a / gcd(a, b) * b; }

// gcc拡張マクロ
#define popcount __builtin_popcount
#define popcountll __builtin_popcountll

// エイリアス
#define DANCE_ long
#define ROBOT_ unsigned
#define HUMAN_ signed
#define CHOKUDAI_ const
using  ll = DANCE_ HUMAN_ DANCE_;
using ull = DANCE_ ROBOT_ DANCE_;
using cll = DANCE_ DANCE_ CHOKUDAI_;
using  ld = long double;
using namespace std;

// モジュール

// Kahn (1962) のアルゴリズムによるトポソ DAGでないものを入れると鼻から悪魔が出る可能性がある
vector<ll> toposo(const vector<vector<ll>> &g) {
    ll n = g.size();
    vector<ll> r; r.reserve(n);
    vector<ll> indeg(n, 0);
    for (ll i = 0; i < n; i++) {
        for (const ll &j : g[i]) {
            ++indeg[j];
        }
    }
    deque<ll> zerodeg;
    for (ll i = 0; i < n; i++) {
        if (!indeg[i]) {
            zerodeg.push_back(i);
        }
    }
    while (zerodeg.size()) {
        ll i = zerodeg.front(); zerodeg.pop_front();
        r.push_back(i);
        for (const ll &j : g[i]) {
            if (--indeg[j] == 0) {
                zerodeg.push_back(j);
            }
        }
    }
    return r;
}

// 処理内容
int main() {
    
    // インタラクティブ問題では除去した方がいいかも
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    
    ll n, m; cin >> n >> m;
    vector<vector<ll>> g(n), h(n);
    REP(i, n-1+m) {
        ll a, b; cin >> a >> b;
        a--; b--;
        g[a].emplace_back(b);
        h[b].emplace_back(a);
    }

    auto tp = toposo(g);
    vector<ll> tpinv(n);
    REP(i, n) tpinv[tp[i]] = i;

    REP(i, n) {
        ll par = -1, pmax = -1;
        for (ll j : h[i]) {
            if (chmax(pmax, tpinv[j])) {
                par = j;
            }
        }
        cout << par+1 << endl;
    }
    
}

Measured memory_bytes: 13296