#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <limits>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <functional>
#include <iomanip>

using namespace std;

#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define eprintf(...) 42
#endif
using ll = long long;
using vll = std::vector<ll>;
using vvll = std::vector<vll>;
using vvvll = std::vector<vvll>;
#define reps(i, S, E) for (ll i = (S); i <= (E); i++)
#define rep(i, N) reps(i, 0, N-1)
#define deps(i, E, S) for (ll i = (E); i >= (S); i--)
#define dep(i, N) deps(i, N-1, 0)
const ll INF = 1LL << 60;
const int INF_INT = 1 << 30;

template<class T> inline bool chmax(T &a, T b) { if (a < b) { a = b; return true; }return false; }
template<class T> inline bool chmin(T &a, T b) { if (a > b) { a = b; return true; }return false; }
struct mll {
	static ll MOD;
	ll val;
	mll(ll v = 0) : val(v % MOD) { if (val < 0) val += MOD; }
	mll operator - () const { return -val; }
	mll operator + (const mll &b) const { return val + b.val; }
	mll operator - (const mll &b) const { return val - b.val; }
	mll operator * (const mll &b) const { return val * b.val; }
	mll operator / (const mll &b) const { return mll(*this) /= b; }
	mll operator + (ll b) const { return *this + mll(b); }
	mll operator - (ll b) const { return *this - mll(b); }
	mll operator * (ll b) const { return *this * mll(b); }
	friend mll operator + (ll a, const mll &b) { return b + a; }
	friend mll operator - (ll a, const mll &b) { return -b + a; }
	friend mll operator * (ll a, const mll &b) { return b * a; }
	mll &operator += (const mll &b) { val = (val + b.val) % MOD; return *this; }
	mll &operator -= (const mll &b) { val = (val + MOD - b.val) % MOD; return *this; }
	mll &operator *= (const mll &b) { val = (val*b.val) % MOD; return *this; }
	mll &operator /= (const mll &b) {
		ll c = b.val, d = MOD, u = 1, v = 0;
		while (d) {
			ll t = c / d;
			c -= t * d; swap(c, d);
			u -= t * v; swap(u, v);
		}
		val = val * u % MOD;
		if (val < 0) val += MOD;
		return *this;
	}
	mll &operator += (ll b) { return *this += mll(b); }
	mll &operator -= (ll b) { return *this -= mll(b); }
	mll &operator *= (ll b) { return *this *= mll(b); }
	mll &operator /= (ll b) { return *this /= mll(b); }
	bool operator == (const mll &b) { return val == b.val; }
	bool operator != (const mll &b) { return val != b.val; }
	bool operator == (ll b) { return *this == mll(b); }
	bool operator != (ll b) { return *this != mll(b); }
	friend bool operator == (ll a, const mll &b) { return mll(a) == b.val; }
	friend bool operator != (ll a, const mll &b) { return mll(a) != b.val; }
	friend ostream &operator << (ostream &os, const mll &a) { return os << a.val; }
	friend istream &operator >> (istream &is, mll &a) { return is >> a.val; }
	static mll Combination(ll a, ll b) {
		chmin(b, a - b);
		if (b < 0) return mll(0);
		mll c = 1;
		rep(i, b) c *= a - i;
		rep(i, b) c /= i + 1;
		return c;
	}
};
using vmll = std::vector<mll>;
using vvmll = std::vector<vmll>;
using vvvmll = std::vector<vvmll>;
using vvvvmll = std::vector<vvvmll>;

struct Fast {
	Fast() {
		cin.tie(0);
		ios::sync_with_stdio(false);
		cout << fixed << setprecision(std::numeric_limits<double>::max_digits10);
	}
} fast; //cin,cout高速化のおまじない＋桁数指定

ll mll::MOD = (ll)(1e9 + 7);// 998244353ll;


int main() {
	ll N;
	cin >> N;
	ll M;
	cin >> M;

	//グラフ表現(Nノードのうちノードindexから別のノード番号へ接続)
	vector<vector<ll>> graph(N + 1, vector<ll>(0));
	vll inCount(N + 1, 0);

	rep(i, N - 1 + M) {
		ll a;
		cin >> a;
		ll b;
		cin >> b;

		graph[a].push_back(b);
		inCount[b]++;
	}

	vll sorted(0);
	stack<ll> st;

	//入次数がゼロのノードをスタックに入れる
	reps(i, 1, N) {
		if (inCount[i] == 0) {
			st.push(i);
		}
	}

	//トポロジカルソート
	while (st.empty() == false) {
		ll curr = st.top();
		st.pop();
		sorted.push_back(curr);

		for (auto next : graph[curr]) {
			inCount[next]--;
			if (inCount[next] == 0) {
				st.push(next);
			}
		}
	}

	vll parent(N + 1, 0);
	for (auto node : sorted) {
		for (auto next : graph[node]) {
			parent[next] = node;
		}
	}


	//根からBFS
	//queue<ll> q;
	//vll dist(N + 1, -1);
	//vll parent(N + 1, -1);
	//dist[root] = 0;
	//parent[root] = 0;
	//q.push(root);

	//while (q.empty() == false) {
	//	ll curr = q.front();
	//	q.pop();
	//	ll currDist = dist[curr];

	//	for (auto next : graph[curr]) {
	//		if (dist[next] < 0) {
	//			dist[next] = currDist + 1;
	//			parent[next] = curr;
	//			q.push(next);
	//		}
	//		else if (dist[next] < currDist + 1) {
	//			dist[next] = currDist + 1;
	//			parent[next] = curr;
	//			q.push(next);
	//		}
	//	}
	//}

	reps(i, 1, N) {
		cout << parent[i] << endl;
	}

	return 0;
}


Measured memory_bytes: 8820