#include<iostream>
#include<algorithm>
#include<string>
#include<cstdlib>
#include<map>
#include<iomanip>
#include<sstream>
#include<vector>
#include<stack>
#include<math.h>
#include<queue>
#include<complex>
using namespace std;


const long long int mod=1000000007;
const long long int INF=99999999999999999;


//INFを宣言すること。Edgeに辺の情報を入れよう。
class Graph{
//メンバ変数の説明
//Edge:一つ目の番号が辺が出る方向
//MaxV,MaxE:頂点数と辺の数
//Result系:各メソッドの答え
//InfinteUpdate:BellmanFordで各番号の頂点までの最短経路が更新されるか
//
public:
	vector<pair<long long int,long long int> > *Edge;
	vector<pair<pair<long long int,long long int>,long long int> >PrimEdge;
	long long int MaxV,MaxE;
	long long int *BellmanFordResult,*DijkstraResult,**WarshallFloydResult;
	bool *InfiniteUpdate;
	bool NegativeLoop=false;
	long long int PrimResult=0;
	bool NotConected=false;
	long long int *InEdge;
	vector<long long int>TopologicalSortdVertex;


	Graph(long long int InputV,long long int InputE){
		MaxV=InputV;
		MaxE=InputE;
		Edge=new vector<pair<long long int,long long int> >[InputV+1];

	}
	
	void BellmanFord(long long int Start) {
		BellmanFordResult=new long long int[MaxV];
		InfiniteUpdate=new bool[MaxV];
		for (int i = 0; i < MaxV; i++) { BellmanFordResult[i] = INF;InfiniteUpdate[i]=false; }
		BellmanFordResult[Start] = 0;
		long long int turn=0;
		while (true) {
			turn++;
			bool update = false;
			for (int i = 0; i < MaxV; i++) {
				for(int j=0;j<Edge[i].size();j++){
					pair<long long int,long long int> e = Edge[i][j];
					if(turn>=MaxV&&InfiniteUpdate[i])
					{
						InfiniteUpdate[e.first]=true;
					}
					if (BellmanFordResult[i] != INF && BellmanFordResult[e.first] > BellmanFordResult[i] + e.second) {
						BellmanFordResult[e.first] = BellmanFordResult[i] + e.second;
						update = true;
						if(turn>=MaxV){
							InfiniteUpdate[e.first]=true;
						}
					}
				}
			}
			if (!update) { 
				NegativeLoop=false;
				break; 
			}
			if(turn>=2*MaxV-1){
				NegativeLoop=true;
				break;
			}
		}
	}

	void Dijkstra(long long int Start) {
		DijkstraResult=new long long int[MaxV];
		priority_queue<pair<long long int,long long int>, vector<pair<long long int,long long int> >, greater<pair<long long int,long long int> > >que;
		fill(DijkstraResult, DijkstraResult + MaxV, INF);
		DijkstraResult[Start] = 0;
		que.push(pair<long long int,long long int>(0, Start));

		while (!que.empty()) {
			pair<long long int,long long int> p = que.top();
			que.pop();
			long long int v = p.second;
			if (DijkstraResult[v] < p.first)continue;
			for (int i = 0; i < Edge[v].size(); i++) {
				pair<long long int,long long int> e = Edge[v][i];
				if (DijkstraResult[e.first] > DijkstraResult[v] + e.second) {
					DijkstraResult[e.first] = DijkstraResult[v] + e.second;
					que.push(pair<long long int,long long int>(DijkstraResult[e.first], e.first));
				}
			}
		}
	}

	void WarshallFloyd() {
		WarshallFloydResult=new long long int*[MaxV];
		for(int i=0;i<MaxV;i++){
			WarshallFloydResult[i]=new long long int[MaxV];
		}
		for(int i=0;i<MaxV;i++){
			for(int j=0;j<Edge[i].size();j++){
				WarshallFloydResult[i][Edge[i][j].first]=Edge[i][j].second;
			}
		}

		for (int k = 0; k < MaxV; k++) {
			for (int i = 0; i < MaxV; i++) {
				for (int j = 0; j < MaxV; j++) {
					WarshallFloydResult[i][j] = min(WarshallFloydResult[i][j], WarshallFloydResult[i][k] + WarshallFloydResult[k][j]);
				}
			}
		}
	}
	void Prim(){
		NotConected=false;
		priority_queue<pair<long long int,pair<long long int,long long int> >,vector<pair<long long int,pair<long long int,long long int> > > ,greater<pair<long long int,pair<long long int,long long int> > > >PriorityEdge;
		bool *IncludedVertex=new bool[MaxV];
		fill(IncludedVertex,IncludedVertex+MaxV,false);
		PrimEdge.clear();
		for(int i=0;i<Edge[0].size();i++)
		{
			PriorityEdge.push({Edge[0][i].second,{0,Edge[0][i].first}});
		}
		IncludedVertex[0]=true;
		for(int i=0;i<MaxV-1;i++)
		{
			while(1)
			{
				if(PriorityEdge.empty())
				{
					NotConected=true;
					break;
				}
				pair<long long int,pair<long long int,long long int> > pe = PriorityEdge.top();
				PriorityEdge.pop();
				//cout<<pe.first<<" "<<pe.second.first<<" "<<pe.second.second<<endl;
				if(!IncludedVertex[pe.second.second])
				{
					IncludedVertex[pe.second.second]=true;
					PrimResult+=pe.first;
					PrimEdge.push_back({pe.second,pe.first});
					//cout<<"size"<<pe.second.second<<" "<<Edge[pe.second.second].size()<<endl;
					for(int j=0;j<Edge[pe.second.second].size();j++)
					{
						PriorityEdge.push({Edge[pe.second.second][j].second,{pe.second.second,Edge[pe.second.second][j].first}});
					}
					break;
				}
			}
		}
	}


	long long int *Parent;
	void TopologicalSort(){
		bool notupdate=false;
		InEdge=new long long int[MaxV];
		Parent=new long long int[MaxV];
		TopologicalSortdVertex.clear();
		queue<long long int>task,firsttask;
		for(int i=0;i<MaxV;i++){
			InEdge[i]=0;
		}
		for(int i=0;i<MaxV;i++){
			for(int j=0;j<Edge[i].size();j++){
				InEdge[Edge[i][j].first]++;
			}
		}
		//cout<<"x"<<InEdge[0]<<" "<<InEdge[1]<<" "<<InEdge[2]<<endl;
		for(int i=0;i<MaxV;i++){
			if(InEdge[i]==0){
				Parent[i]=0;
				firsttask.push(i);
			}

		}
		while(!firsttask.empty()){
			long long int i=firsttask.front();
			firsttask.pop();
			//cout<<"FirstInEdge: "<<i<<" "<<InEdge[i]<<endl;
			if(InEdge[i]==0){
				Parent[i]=0;
				InEdge[i]=-1;
				for(int j=0;j<Edge[i].size();j++){
					InEdge[Edge[i][j].first]--;
					if(InEdge[Edge[i][j].first]==0){
						Parent[Edge[i][j].first]=i+1;
						task.push(Edge[i][j].first);
					}
				}
			}

		}
		while(!task.empty()){
			long long int tmp=task.front();
			//cout<<"Debug: "<<tmp<<endl;
			for(int i=0;i<MaxV;i++){
				//cout<<"InEdge: "<<i<<" "<<InEdge[i]<<endl;
			}
			task.pop();
			if(InEdge[tmp]==0){
				TopologicalSortdVertex.push_back(tmp);
				InEdge[tmp]=-1;
				for(int j=0;j<Edge[tmp].size();j++){
					InEdge[Edge[tmp][j].first]--;
					if(InEdge[Edge[tmp][j].first]==0){
						Parent[Edge[tmp][j].first]=tmp+1;
						task.push(Edge[tmp][j].first);
					}
				}
			}
			
		}
	}
};



int main() {
    long long int N,M;
	//cout << fixed << setprecision(10);
	cin>>N>>M;
	Graph graph(N,N+M-1);
	for(int i=0;i<N+M-1;i++){
		long long int A,B;
		
		cin>>A>>B;
		A--;B--;
		graph.Edge[A].push_back({B,1});
	}
	graph.TopologicalSort();
	for(int i=0;i<N;i++){
		cout<<graph.Parent[i]<<endl;
	}
}


Measured memory_bytes: 8944