#ifdef LOCAL111
	#define _GLIBCXX_DEBUG
#else
	#define NDEBUG
#endif
#define _USE_MATH_DEFINES
#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>

#if __cplusplus >= 201103L
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
#endif

// C++
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>

#if __cplusplus >= 201103L
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <type_traits>
#include <typeindex>
#include <unordered_map>
#include <unordered_set>
#endif
const int INF = 1e9;
using namespace std;
template<typename T, typename U> ostream& operator<< (ostream& os, const pair<T,U>& p) { os << '(' << p.first << ' ' << p.second << ')'; return os; }

#define endl '\n'
#define ALL(a)  (a).begin(),(a).end()
#define SZ(a) int((a).size())
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n)  FOR(i,0,n)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
#ifdef LOCAL111
	#define DEBUG(x) cout<<#x<<": "<<(x)<<endl
	template<typename T> void dpite(T a, T b){ for(T ite = a; ite != b; ite++) cout << (ite == a ? "" : " ") << *ite; cout << endl;}
#else
	#define DEBUG(x) true
	template<typename T> void dpite(T a, T b){ return; }
#endif
#define F first
#define S second
#define SNP string::npos
#define WRC(hoge) cout << "Case #" << (hoge)+1 << ": "
template<typename T> void pite(T a, T b){ for(T ite = a; ite != b; ite++) cout << (ite == a ? "" : " ") << *ite; cout << endl;}
template<typename T> bool chmax(T& a, T b){if(a < b){a = b; return true;} return false;}
template<typename T> bool chmin(T& a, T b){if(a > b){a = b; return true;} return false;}

typedef long long int LL;
typedef unsigned long long ULL;
typedef pair<int,int> P;

void ios_init(){
	//cout.setf(ios::fixed);
	//cout.precision(12);
#ifdef LOCAL111
	return;
#endif
	ios::sync_with_stdio(false); cin.tie(0);
}

//library

class UFTree {
//private:
public:
	vector<int> par;
	vector<int> rank;
	vector<int> num;

//public:
	UFTree(int n)
	{
		par = vector<int>(n);
		rank = vector<int>(n);
		num = vector<int>(n);
		for(int i = 0; i < n; i++){
			par[i] = i;
			rank[i] = 0;
			num[i] = 1;
		}
	}

	int find(int x)
	{
		if(par[x] == x){
			return x;
		}else{
			return par[x] = find(par[x]);
		}
	}

	void unite(int x, int y)
	{
		x = find(x);
		y = find(y);
		if(x == y) return;
		if(rank[x] < rank[y]){
			par[x] = y;
			num[y] += num[x];
		}else{
			par[y] = x;
			num[x] += num[y];
			if(rank[x] == rank[y])	rank[x]++;
		}
	}

	int count(int x)
	{
		return num[find(x)];
	}

	bool same(int x, int y)
	{
		return find(x) == find(y);
	}
};
//library

typedef long long cost_t;

class Edge {
public:
	int to = -1;
	cost_t cost = -1;
	
	Edge(){
	}

	Edge(int x,cost_t y){
		to = x;
		cost = y;
	}

	// Edge(int x, int y, cost_t z){
	// 	// from = x;
	// 	to = y;
	// 	cost = z;
	// }

	// Edge(int x, int y, int r, cost_t z){
	// 	// from = x;
	// 	to = y;
	// 	cost = z;
	// 	// rev = r;
	// }

	bool operator< (const Edge& x) const {
		if(cost != x.cost) return cost < x.cost;
		return to < x.to;
	}

	bool operator> (const Edge& x) const {
		if(cost != x.cost) return cost > x.cost;
		return to > x.to;
	}
};

class Graph {
private:
	typedef vector<Edge> Edges;
	//const long long int INF = (long long)1e18;
	vector<Edges> v; 
	int n;
public:
	Graph(int x){
		n = x;
		v = vector<Edges>(x);
	}

	Graph(){}

	Edges& operator[](int x){
		return v[x];
	}

	const Edges& operator[](int x) const {
		return v[x];
	}

	int size() const {
		return n;
	}

	void add_edge(int from, const Edge &e){
		v[from].push_back(e);
	}

	void add_edge(int from, int to, cost_t cost = -1){
		add_edge(from,Edge(to,cost));
	}

	// void add_edge(int from, int to, cost_t cost = -1, int rev = -1){
	// 	add_edge(from,Edge(from,to,rev,cost));
	// }

	void add_uedge(int from, int to, cost_t cost = -1){
		add_edge(from,to,cost);
		add_edge(to,from,cost);
	}
};

vector<int> toposort(const Graph &g)
{
	int n = g.size();
	vector<int> res;
	res.reserve(n);
	vector<bool> used(n,false);
	function<void(int)> rec = [&](int p){
		if(used[p]) return;
		used[p] = true;
		for(auto&& e : g[p]) {
			rec(e.to);
		}
		res.push_back(p);
	};
	for(int i = 0; i < n; ++i) {
		if(!used[i]) rec(i);
	}
	// reverse(res.begin(), res.end());
	return res;
}

class GraphVizualizer{
	int cnt;
public:
	GraphVizualizer(){
		cnt = 0;
	}

	void operator() (const Graph &g, bool with_dir = true, bool with_cap = false){
		ofstream ofs("./out.dot");
		if(!with_dir) ofs << "graph graph_name {" << endl;
		else ofs << "digraph graph_name {" << endl;
		for(int i = 0; i < (int)g.size(); ++i) {
			ofs << "    " << i << "[];" << endl;
		}
		for(int i = 0; i < (int)g.size(); i++){
			if (!g[i].size())
				continue;
			for(const auto &e : g[i]){
				if(!with_dir){
					if(e.to > i) ofs << "    " << i << " -- " << e.to ; 
				}else ofs << "    " << i << " -> " << e.to ; 
				
				if (with_cap) {
					ofs << " [ label = \"" << (e.cost  == INF ? "inf" : to_string(e.cost)) << "\"];"; 
				}
				if(with_dir or e.to > i)ofs << endl;
			}
		}
		ofs << "}" << endl;
		ofs.close();
		string cmd = "dot -T png out.dot > ";
		cmd = cmd+"sample"+to_string(cnt)+".png";
		system(cmd.c_str());	
		cnt++;
	}
};

int main()
{
	ios_init();
	int n, m;
	// GraphVizualizer viz;
	while(cin >> n >> m) {
		// vector<int> a(n + m - 1), b(n + m - 1);
		Graph g(n);
		REP(i, n + m - 1) {
			int a, b;
			cin >> a >> b;
			a--;
			b--;
			g.add_edge(a, b);
		}
		// viz(g);
		UFTree uf(n);
		auto topo = toposort(g);
		dpite(ALL(topo));
		// reverse(ALL(topo));
		vector<LL> nv(n);
		vector<P> ans;
		REP(i, n) {
			auto v = topo[i];
			DEBUG(v);
			if(g[v].size() == 0) {
				nv[v] = 0;
			} else {
				map<int, vector<int>> ma;
				for(auto&& e : g[v]) {
					ma[uf.find(e.to)].push_back(e.to);
				}
				for(auto&& e : ma) {
					dpite(ALL(e.S));
					LL ma = -1;
					int to = -1;
					REP(i, e.S.size()) {
						if(chmax(ma, nv[e.S[i]])) to = e.S[i];
					}
					ans.push_back({v, to});
				}
				LL maa = -1;
				for(auto&& e : g[v]) {
					uf.unite(v, e.to);
					chmax(maa, nv[e.to]);
				}
				nv[v] = maa + 1;
			}
		}
		dpite(ALL(ans));
		vector<int> hoge(n);
		REP(i, ans.size()) {
			hoge[ans[i].S] = ans[i].F + 1;
		}
		REP(i, n) {
			cout << hoge[i] << endl;
		}
	}
	return 0;
}


Measured memory_bytes: 19824