// ===== 2019/01/27 21:32:51 =====

// includes.hpp

#include <algorithm>
#include <array>
#include <cassert>
#include <climits>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <tuple>
#include <vector>

// cin.cpp

template <typename T, int M, int N> struct tuple_getter {
  static void get(std::istream &is, T &x) {
    is >> std::get<M>(x);
    tuple_getter<T, M + 1, N>::get(is, x);
  }
};

template <typename T, int N> struct tuple_getter<T, N, N> {
  static void get(std::istream &is, T &x) { is >> std::get<N>(x); }
};

template <typename... Args>
std::istream &operator>>(std::istream &is, std::tuple<Args...> &t) {
  tuple_getter<std::tuple<Args...>, 0, sizeof...(Args) - 1>::get(is, t);
  return is;
}

template <typename T, typename U>
std::istream &operator>>(std::istream &is, std::pair<T, U> &p) {
  is >> p.first >> p.second;
  return is;
}

template <typename T>
std::istream &operator>>(std::istream &is, std::vector<T> &v) {
  for (T &x : v) is >> x;
  return is;
}

// const_value.hpp

namespace sub {
template <typename T>
constexpr typename std::enable_if<std::is_integral<T>::value, T>::type
inf_sub() {
  return std::numeric_limits<T>::max() / 2 - 1000;
}

template <typename T>
constexpr typename std::enable_if<std::is_floating_point<T>::value, T>::type
inf_sub() {
  return std::min(std::numeric_limits<T>::max() / 2 - 1000, T(1e50));
}
}  // namespace sub

template <typename T> constexpr T inf() {
  static_assert(std::is_arithmetic<T>::value, "T must be arithmetic value");
  return sub::inf_sub<T>();
}

template <typename T> constexpr T zero() {
  static_assert(std::is_arithmetic<T>::value, "T must be arithmetic value");
  return T(0);
}

const long double pi = acos(-1.0);

// cout.cpp

template <typename T, int M, int N> struct tuple_printer {
  static void print(std::ostream &os, const T &x) {
    os << std::get<M>(x) << " ";
    tuple_printer<T, M + 1, N>::print(os, x);
  }
};

template <typename T, int N> struct tuple_printer<T, N, N> {
  static void print(std::ostream &os, const T &x) { os << std::get<N>(x); }
};

template <typename... Args>
std::ostream &operator<<(std::ostream &os, const std::tuple<Args...> &t) {
  tuple_printer<std::tuple<Args...>, 0, sizeof...(Args) - 1>::print(os, t);
  return os;
}

template <typename T, typename U>
std::ostream &operator<<(std::ostream &os, const std::pair<T, U> &p) {
  os << p.first << " " << p.second;
  return os;
}

template <typename T>
std::ostream &operator<<(std::ostream &os, const std::vector<T> &v) {
  for (auto it = v.begin(); it != v.end(); ++it) {
    if (it != v.begin()) os << " ";
    os << *it;
  }
  return os;
}

template <typename T>
std::ostream &operator<<(std::ostream &os, const std::set<T> &v) {
  for (auto it = v.begin(); it != v.end(); ++it) {
    if (it != v.begin()) os << " ";
    os << *it;
  }
  return os;
}

// macros.hpp

#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(x) (x).begin(), (x).end()

// misc.hpp

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); }

// range.hpp

class range {
  class index_type {
    int x;

  public:
    index_type(int x_) : x(x_) {}
    int operator*() const { return x; }
    bool operator!=(index_type &r) { return x < r.x; }
    void operator++() { ++x; }
  };
  index_type i, n;

public:
  range(int n_) : i(0), n(n_) {}
  range(int i_, int n_) : i(i_), n(n_) {}
  index_type &begin() { return i; }
  index_type &end() { return n; }
};

// typedef.hpp

using ll = long long;
using ld = long double;

// template.cpp

using namespace std;

// definition.hpp

template <class edge_t> class graph_t {
  std::vector<std::vector<edge_t>> g;

public:
  using reference = std::vector<edge_t> &;
  using const_reference = const std::vector<edge_t> &;
  using iterator = typename std::vector<edge_t>::iterator;
  graph_t() : g(0) { ; }
  graph_t(int n) : g(n) { ; }
  int size() const { return g.size(); }
  void push_back(const std::vector<edge_t> &es) { g.push_back(es); }
  reference operator[](int x) { return g[x]; }
  const_reference operator[](int x) const { return g[x]; }
  iterator &begin() { return begin(g); }
  iterator &end() { return end(g); }
};

// directed_graph.hpp

class DirectedEdge {
public:
  using cost_type = int;
  int to;
  static const cost_type cost = 1;
  DirectedEdge(int, int t) : to(t) { ; }
};

using DirectedGraph = graph_t<DirectedEdge>;

void add_edge(DirectedGraph &g, int from, int to) {
  g[from].emplace_back(from, to);
}

// scc.cpp

template <typename edge_t> struct scc_struct {
  const int n;
  const graph_t<edge_t> g;
  std::vector<std::vector<int>> rg;
  std::vector<int> cmp, vs;
  std::vector<bool> used;
  void dfs(int v) {
    used[v] = true;
    for (edge_t e : g[v])
      if (!used[e.to]) dfs(e.to);
    vs.push_back(v);
  };
  void rdfs(int v, int k) {
    used[v] = true;
    cmp[v] = k;
    for (int i : rg[v])
      if (!used[i]) rdfs(i, k);
  };
  scc_struct(const graph_t<edge_t> &g_) :
    n(g_.size()), g(g_), rg(n), cmp(n), vs(0), used(n, false) {
    for (int i = 0; i < n; ++i) {
      for (edge_t e : g[i]) {
        rg[e.to].push_back(i);
      }
    }
    for (int v = 0; v < n; ++v) {
      if (!used[v]) dfs(v);
    }
    std::fill(begin(used), end(used), false);
    std::reverse(begin(vs), end(vs));
    int k = 0;
    for (int i : vs)
      if (!used[i]) rdfs(i, k++);
  }
};

template <typename edge_t> std::vector<int> scc(const graph_t<edge_t> &g) {
  scc_struct<edge_t> s(g);
  return s.cmp;
}

// main.cpp

template <typename T> vector<T> table(int n, T v) { return vector<T>(n, v); }

template <class... Args> auto table(int n, Args... args) {
  auto val = table(args...);
  return vector<decltype(val)>(n, move(val));
}

void solve(long long N, long long M, std::vector<long long> A,
           std::vector<long long> B) {
  DirectedGraph g(N);
  REP(i,N-1+M) add_edge(g, A[i] - 1, B[i] - 1);
  vector<int> cmp = scc(g);
  // for (int i: cmp) cout << i << " ";
  vector<pair<int,int>> vec;
  REP(i,N) vec.emplace_back(cmp[i], i);
  sort(ALL(vec));
  vector<int> res(N, -1);
  REP(v,N) {
    for (DirectedEdge e: g[v]) {
      if (res[e.to] == -1 || cmp[v] > cmp[res[e.to]])
        res[e.to] = v;
    }
  }
  REP(i,N) cout << res[i] + 1 << endl;
  // FILL IN HERE.
}

int main() {
  long long N;
  scanf("%lld", &N);
  long long M;
  scanf("%lld", &M);
  std::vector<long long> A(N - 1 + M);
  std::vector<long long> B(N - 1 + M);
  for (int i = 0; i < N - 1 + M; i++) {
    scanf("%lld", &A[i]);
    scanf("%lld", &B[i]);
  }
  solve(N, M, A, B);
  return 0;
}

// ===== 2019/01/27 21:32:51 =====


Measured memory_bytes: 22780