#include<bits/stdc++.h>
using namespace std;
const int N=2e6+5;
vector<int>ed[N],st[N]; 
int in[N],out[N],tin[N];
int t1[N],t2[N],len1,len2;
int q[N];
int n,m;
map<pair<int,int>,int>mp;
int dfn[N];
void toposort(){
	int l=1,r=0;
	for(int i=1;i<=n;i++){
		if(!in[i])q[++r]=i;
	}
	while(l<=r){
		int u=q[l++];
		//cout<<u<<" ";
		t1[++len1]=u;
		int lenn=ed[u].size();
		for(int i=0;i<lenn;i++){
			int v=ed[u][i];
			tin[v]--;
			if(!tin[v])q[++r]=v;
		}
	}
}
bool ans[N];
void tz(){
	int cnt=0;
	for(int i=1;i<=n;i++){
		if(!tin[i])cnt++;
	}
	for(int i=1;i<=n;i++){
		if(cnt!=1)ans[t1[i]]=0;
		int u=t1[i];
		int lenn=ed[u].size();
		cnt--;
		for(int j=0;j<lenn;j++){
			int v=ed[u][j];
			tin[v]--;
			if(!tin[v])cnt++;
		}
	}
}
void tf(){
	int cnt=0;
	for(int i=1;i<=n;i++){
		if(!tin[i])cnt++;
	}
	for(int i=1;i<=n;i++){
		if(cnt!=1)ans[t1[n+1-i]]=0;
		int u=t1[n+1-i];
		int lenn=st[u].size();
		cnt--;
		for(int j=0;j<lenn;j++){
			int v=st[u][j];
			tin[v]--;
			if(!tin[v])cnt++;
		}
	}
}
struct Node{
	int lson,rson,min_n,max_x;
};
struct Seg{
	Node t[N*10];
	int tot;
	void update(int id){
		t[id].min_n=min(t[t[id].lson].min_n,t[t[id].rson].min_n);
		t[id].max_x=max(t[t[id].lson].max_x,t[t[id].rson].max_x);
	} 
	void build(int id,int l,int r){
		if(l==r){
			t[id].min_n=0;
			t[id].max_x=n+1;
			///cout<<id<<" "<<l<<" "<<r<<" "<<t[id].max_x<<"\n";
			return;
		}
		tot++;
		t[id].lson=tot;
		tot++;
		t[id].rson=tot;
		int mid=(l+r)>>1;
		build(t[id].lson,l,mid);
		build(t[id].rson,mid+1,r);
		update(id);
		//cout<<l<<" "<<r<<" "<<t[id].max_x<<"\n";
	}
	void changemax(int pre,int l,int r,int k,int c,int&id){
		tot++;
		t[tot]=t[pre];
		id=tot;
		if(l==r){
			t[tot].max_x=c;
			return;
		}
		int mid=(l+r)>>1;
		if(k<=mid)changemax(t[pre].lson,l,mid,k,c,t[id].lson);
		else changemax(t[pre].rson,mid+1,r,k,c,t[id].rson);
		update(id);
	}
	void changemin(int pre,int l,int r,int k,int c,int&id){
		tot++;
		t[tot]=t[pre];
		id=tot;
		if(l==r){
			t[tot].min_n=c;
			return;
		}
		int mid=(l+r)>>1;
		if(k<=mid)changemin(t[pre].lson,l,mid,k,c,t[id].lson);
		else changemin(t[pre].rson,mid+1,r,k,c,t[id].rson);
		update(id);
	}
	int querymax(int id,int l,int r,int l1,int r1){
		//cout<<id<<" "<<l<<" "<<r<<" "<<l1<<" "<<r1<<" "<<t[id].max_x<<"\n";
		if(l1>r1)return 0;
		if(l==l1&&r==r1)return t[id].max_x;
		int mid=l+r>>1;
		if(r1<=mid)return querymax(t[id].lson,l,mid,l1,r1);
		else if(mid+1<=l1)return querymax(t[id].rson,mid+1,r,l1,r1);
		else return max(querymax(t[id].lson,l,mid,l1,mid),querymax(t[id].rson,mid+1,r,mid+1,r1));
	}
	int querymin(int id,int l,int r,int l1,int r1){
		if(l1>r1)return n+1;
		if(l==l1&&r==r1)return t[id].min_n;
		int mid=l+r>>1;
		if(r1<=mid)return querymin(t[id].lson,l,mid,l1,r1);
		else if(mid+1<=l1)return querymin(t[id].rson,mid+1,r,l1,r1);
		else return min(querymin(t[id].lson,l,mid,l1,mid),querymin(t[id].rson,mid+1,r,mid+1,r1));
	}
}T1,T2;
int rt1[N],rt2[N];
int max_x[N],min_n[N];
int U[N],V[N],ecnt=0;
int idx[N];
bool check(int ver,int pos){
	//cout<<pos<<"\n";
	return T1.querymin(rt1[ver],1,n,pos+1,n)>=pos&&T2.querymax(rt2[ver],1,n,1,pos-1)<=pos;
}
int main(){
	scanf("%d%d",&n,&m);
	for(int i=1;i<=m;i++){
		int u,v;
		scanf("%d%d",&u,&v);
		if(mp[make_pair(u,v)])continue;
		mp[make_pair(u,v)]=1;
		ed[u].push_back(v); 
		st[v].push_back(u);
		in[v]++;
		out[u]++;
		ecnt++;
		idx[ecnt]=i;
		U[ecnt]=u;
		V[ecnt]=v;
	}
	for(int i=1;i<=n;i++)ans[i]=1;
	for(int i=1;i<=n;i++)tin[i]=in[i];
	toposort();
	for(int i=1;i<=n;i++)tin[i]=in[i];
	tz();
	for(int i=1;i<=n;i++)tin[i]=out[i];
	tf();
	for(int i=1;i<=n;i++){
		//if(!ans[i])cout<<-1<<" ";
		//else cout<<"1 ";
		dfn[t1[i]]=i;
		max_x[i]=0;
		min_n[i]=n+1;
	}
	T1.tot++;
	T2.tot++;
	rt1[0]=rt2[0]=1;
	T1.build(1,1,n);
	T2.build(1,1,n);
	for(int i=1;i<=ecnt;i++){
		//cout<<T2.querymax(rt2[i-1],1,n,2,2)<<"\n";
		if(dfn[U[i]]>max_x[dfn[V[i]]])T1.changemin(rt1[i-1],1,n,dfn[V[i]],dfn[U[i]],rt1[i]);
		else rt1[i]=rt1[i-1];
		max_x[dfn[V[i]]]=max(max_x[dfn[V[i]]],dfn[U[i]]);
		if(dfn[V[i]]<min_n[dfn[U[i]]])T2.changemax(rt2[i-1],1,n,dfn[U[i]],dfn[V[i]],rt2[i]);
		else rt2[i]=rt2[i-1];
		min_n[dfn[U[i]]]=min(min_n[dfn[U[i]]],dfn[V[i]]);
		//cout<<"min:"<<dfn[V[i]]<<" "<<max_x[dfn[V[i]]]<<"\n";
	}
	//cout<<T2.querymax(rt2[2],1,n,2,2)<<"\n";
	for(int i=1;i<=n;i++){
		if(!ans[i])cout<<-1<<" ";
		else{
			int l=1,r=ecnt,ans=ecnt;
			while(l<=r){
				int mid=l+r>>1;
				if(check(mid,dfn[i])){
					ans=mid;
					r=mid-1;
				}
				else l=mid+1;
			}
			cout<<idx[ans]<<" ";
		}
	}
	cout<<"\n";
	return 0;
}