#include <bits/stdc++.h>
using namespace std;

template <typename A, typename B>
string to_string(pair<A, B> p);

template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);

template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);

string to_string(const string& s) {
  return '"' + s + '"';
}

string to_string(const char* s) {
  return to_string((string) s);
}

string to_string(bool b) {
  return (b ? "true" : "false");
}

string to_string(vector<bool> v) {
  bool first = true;
  string res = "{";
  for (int i = 0; i < static_cast<int>(v.size()); i++) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(v[i]);
  }
  res += "}";
  return res;
}

template <size_t N>
string to_string(bitset<N> v) {
  string res = "";
  for (size_t i = 0; i < N; i++) {
    res += static_cast<char>('0' + v[i]);
  }
  return res;
}

template <typename A>
string to_string(A v) {
  bool first = true;
  string res = "{";
  for (const auto &x : v) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(x);
  }
  res += "}";
  return res;
}

template <typename A, typename B>
string to_string(pair<A, B> p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}

template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ")";
}

template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug_out(T...);
}
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)

#define rep(i,n) for (int i = 0; i < n; ++i)
#define reps(i,s,n) for (int i = s; i < n; ++i)
#define rep1(i,n) for (int i = 1; i <= n; ++i)
#define per(i,n) for (int i = n - 1; i >= 0; --i)
#define per1(i,n) for (int i = n; i >= 1; --i)
#define all(c) begin(c),end(c)
template<typename T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<typename T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<typename T> inline T intceil(T a, T b) { return (a + (b - 1)) / b; }
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
typedef pair<ll,ll> PL;
const long long MOD = 1e9+7;
#define precout() cout << std::fixed << std::setprecision(20);
#define print(a) cout << a << endl;
template<typename T> void printv(vector<T>&v) {
    int n = v.size() - 1;
    rep(i, n) cout << v[i] << " ";
    cout << v.back() << endl;
}
const string alphabet = "abcdefghijklmnopqrstuvwxyz";
const int dy[4] = { 0, 1, 0, -1 };
const int dx[4] = { 1, 0, -1, 0 };
// if(nextH >= 0 && nextH < H && nextW >= 0 && nextW < W)
static const long double pi = acos(-1.0);
typedef complex<ld> cd;

void topologicalSort_dfs(vector<vector<int>>& G, int cur, vector<int>& sorted, vector<bool>& seen) {
    if(seen[cur]) return;
    seen[cur] = 1;

    for(int&next:G[cur]) {
        topologicalSort_dfs(G, next, sorted, seen);
    }

    sorted.push_back(cur);
}

// https://ferin-tech.hatenablog.com/entry/2017/01/24/184750
vector<int> topologicalSort(vector<vector<int>>& G, int start) {
    int n = G.size();
    vector<int> sorted;
    vector<bool> seen(n, 0);
    topologicalSort_dfs(G, start, sorted, seen);
    reverse(all(sorted));
    return sorted;
}

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

    int N,M; cin >> N >> M;
    int edge = N - 1 + M;
    vector<vector<int>> G(N);
    vector<bool> hasIndegree(N, 0);
    vector<vector<int>> indegrees(N);
    rep(i, edge) {
        int a,b; cin >> a >> b; --a, --b;
        indegrees[b].push_back(a);
        G[a].push_back(b);
        hasIndegree[b] = 1;
    }

    int start;
    rep(i, N) {
        if(!hasIndegree[i]) {
            start = i;
            break;
        }
    }

    auto tSorted = topologicalSort(G, start);
    // debug(start, tSorted);

    vector<int> ans(N, -1);
    vector<int> edgeNum(N, -1);
    ans[start] = -1;
    edgeNum[start] = 0;

    rep1(i, N - 1) {
        int cur = tSorted[i];
        // debug(cur, indegrees[cur]);

        int root = indegrees[cur].front();
        for(auto&cand:indegrees[cur]) {
            if(edgeNum[cand] > edgeNum[root]) {
                root = cand;
            }
        }

        ans[cur] = root;
        edgeNum[cur] = i;
        // debug(ans);
    }

    for(auto&a:ans) {
        print(a + 1);
    }
}


Measured memory_bytes: 19324