#include <iostream>
#include <algorithm>
#include <utility>
#include <string>
#include <vector>
#include <set>
#include <stack>
#include <queue>
#include <map>
#include <math.h>
#include <string.h>
#include <iomanip>
#include <numeric>
#include <cstdlib>
#include <cstdint>
#include <cmath>
#include <functional>
#include <limits>
#include <cassert>

using namespace std;

/* template */

using ll = long long;

void debug_out() { std::cout << std::endl; }
 
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cout << H << " ";
  debug_out(T...);
}

#ifdef LOCAL
#define debug(...) cout << "debug: "; debug_out(__VA_ARGS__)
#else
#define debug(...) 
#endif

#define rep(i, a, n) for (int i = (int)(a); i < (int)(n); i++)
#define rrep(i, a, n) for (int i = ((int)(n-1)); i >= (int)(a); i--)
#define Rep(i, a, n) for (long long i = (long long)(a); i< (long long)(n); i++)
#define RRep(i, a, n) for (long long i = ((long long)(n-1ll)); i>=(long long)(a); i--)
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()

template <typename T>
std::ostream& operator<<(std::ostream& os, std::vector<T> vec) {
  for (std::size_t i = 0; i < vec.size(); i++)os << vec[i] << (i + 1 == vec.size() ? "" : " ");
  return os;
}

struct Edge{
    int to;
    int weight;
    Edge(int t, int w) : to(t), weight(w){ }
};

struct edge{
    int from;
    int to;
    int weight;
    edge(int f,int t,int w) : from(f), to(t), weight(w){ }
};


using Graph = vector<vector<Edge>>;
using graph = vector<vector<int>>;
using edges = vector<edge>;

template <class T>
inline bool chmin(T &a, T b){
    if (a > b){
        a = b;
        return true;
    }
    return false;
}

template <class T>
inline bool chmax(T &a, T b){
    if (a < b){
        a = b;
        return true;
    }
    return false;
}

template <class T>
T lcm(T a, T b){
    return (a*b)/gcd(a,b);
}

bool isPalindrome(string s){
    string t = s;
    reverse(all(t));
    return s==t;
}

constexpr ll LNF = 1e18+7;

constexpr int INF = 1e9+7;



vector<int> dx = {-1,0,1,0,-1,1,-1,1};
vector<int> dy = {0,-1,0,1,1,-1,-1,1};

/* template */

std::vector<int> TopologicalSort(const graph &g){
    int V = g.size();
    std::vector<int> indeg(V,0);
    for(auto &in_edge: g){
        for(auto &e: in_edge){
            indeg[e]++;
        }
    }
    std::queue<int> que;
    for(int i = 0; i<V; i++){
        if(indeg[i]==0) que.push(i);
    }
    std::vector<int> t_sort;
    while(!que.empty()){
        int v = que.front(); que.pop();
        for(auto &nv: g[v]){
            indeg[nv]--;
            if(indeg[nv]==0) que.push(nv);
        }
        t_sort.emplace_back(v);
    }
    return t_sort;
}

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n,m; cin >> n >> m;
    graph g(n);
    vector<int> g_in(n,0);
    rep(i,0,n+m-1){
        int a,b; cin >> a >> b;
        a--; b--;
        g[a].emplace_back(b);
        g_in[b]++;
    }
    vector<int> t_sort = TopologicalSort(g);
    vector<int> ans(n);
    ans[t_sort[0]] = 0;
    rep(i,0,n){
        for(auto &nx: g[t_sort[i]]){
            if(g_in[nx]==1){
                ans[nx] = t_sort[i]+1;
            }
            else{
                g_in[nx]--;
            }
        }
    }
    rep(i,0,n){
        cout << ans[i] << endl;
    }
}

Measured memory_bytes: 7536