#include <bits/stdc++.h>
using namespace std;
/*{{{*/  //template
#define rep(i,n) for(int i=0;i<(int)(n);i++)
constexpr int INF = numeric_limits<int>::max()/2;
constexpr long long LINF = numeric_limits<long long>::max()/3;
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
#define sz(x) (int)(x).size()
#define debug(x) cerr<<#x<<":"<<x<<endl
#define debug2(x,y) cerr<<#x<<","<<#y":"<<x<<","<<y<<endl
//struct fin{ fin(){ cin.tie(0); ios::sync_with_stdio(false); } } fin_;
struct Double{ double d; explicit Double(double x) : d(x){} };
ostream& operator<<(ostream& os,const Double x){ os << fixed << setprecision(20) << x.d; return os; }
template<typename T> ostream& operator<<(ostream& os,const vector<T>& vec){ os << "["; for(const auto& v : vec){ os << v << ","; } os << "]"; return os; }
template<typename T,typename U> ostream& operator<<(ostream& os,const pair<T,U>& p){ os << "(" << p.first << ","<< p.second <<")"; return os; }
template<typename T> ostream& operator<<(ostream& os,const set<T>& st){ os<<"{"; for(T v:st) os<<v<<","; os <<"}"; return os; }
template<typename T,typename U> inline void chmax(T &x,U y){ if(y>x) x = y; }
template<typename T,typename U> inline void chmin(T &x,U y){ if(y<x) x = y; }
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
ll gcd(ll a,ll b){ if(b==0) return a; else return gcd(b,a%b); }
//constexpr double eps = 1e-14; 
constexpr double eps = 1e-10; 
constexpr ll mod = 1e9+7;
const int dx[]={1,0,-1,0} ,dy[] = {0,1,0,-1};
/*}}}*/

ll n,m;
ll e;


constexpr long long inf = numeric_limits<long long>::max()/10;
struct edge{
    long long to,cost;
    edge(){}
    edge(long long to_,long long cost_) : to(to_),cost(cost_){}
};

vector<long long> dijkstra(int s,const vector<vector<edge>>& g){
    using P = pair<long long,long long>;
    long long V = g.size();
    vector<long long> d(V,inf);
    priority_queue<P,vector<P>,greater<P>> que;
    d[s] = 0;
    que.push(P(0,s));
    while(!que.empty()){
        P p=que.top();que.pop();
        long long v=p.second;
        if(d[v]<p.first) continue;
        for(int i=0;i<g[v].size();i++){
            edge e=g[v][i];
            if(d[e.to]>d[v]+e.cost){
                d[e.to]=d[v]+e.cost;
                que.push(P(d[e.to],e.to));
            }
        }
    }
    return d;
}

bool use[100005];
int V,E;
int indeg[100005];
list<int> out;


void bfs(int s,vector<vector<edge>>& G){
    queue<int> que;
    que.push(s);
    use[s]=true;

    while(!que.empty()){
        int u=que.front();
        que.pop();
        out.push_back(u);

        for(auto& vv : G[u]){
            int v = vv.to;
            indeg[v]--;
            if(indeg[v]==0 and !use[v]){
                use[v]=true;
                que.push(v);
            }
        }
    }
}
void tsort(vector<vector<edge>>& G){
    V = n;
    E = e;
    for(int i=0;i<V;i++) indeg[i]=0;

    //入次数を設定
    for(int u=0;u<V;u++){
        for(auto& vv:G[u]){
            int v = vv.to;
            indeg[v]++;
        }
    }

    for(int u=0;u<V;u++){
        if(indeg[u]==0 and !use[u]) bfs(u,G);
    }
}

int main(){
    cin >> n >> m;
    e = n + m - 1;

    vector<int> a(e),b(e);
    set<int> c; rep(i,n) c.insert(i);
    rep(i,e){
        cin >> a[i] >> b[i];
        a[i]--;
        b[i]--;
        c.erase(b[i]);
    }

    int root = *c.begin();

    vector<vector<edge>> g(n);
    vector<vector<edge>> rg(n);
    rep(i,e){
        g[a[i]].push_back(edge(b[i],1));
        rg[b[i]].push_back(edge(a[i],1));
    }

    auto dist = dijkstra(root,g);

    vector<int> par(n,-2);
    par[root] = -1;

    rep(i,n){
        if(rg[i].size() == 1){
            par[i] = rg[i][0].to;
        }
    }


    tsort(rg);


    vector<int> amari;
    vector<int> topo;
    vector<int> order(n);
    int cnt=0;
    for(auto v : out){
        if(par[v] == -2){
            amari.push_back(v);
        }
        order[v] = cnt++;
        topo.push_back(v);
    }

    //cout << topo << endl;

    for(auto v : amari){
        int idx=e;
        for(auto ee : rg[v]){
            int pn = ee.to;
            int pni = order[pn];
            if(pni < order[v]) continue;
            idx=min(idx,pni);
        }
        par[v] = topo[idx];
    }

    rep(i,n){
        cout << par[i]+1 << endl;
    }
}


Measured memory_bytes: 18296