#pragma GCC optimize("Ofast")
#pragma GCC target("avx2")

char*mmap();
#define RD(v) int v=0;{int _c;while(_c=*rp++-48,_c>=0)v=v*10+_c;}

char wbuf[7*200000];

typedef struct{
	int val;
	int next;
	int sib;
} Node;

typedef struct{
	int k;
	int prev;
} Move;

typedef struct{
	int pos;
	int len;
} Group;

Node nodes[400001];
Move moves[200000];
Group groups[400001];
latest[200001];
final[200001];

f(i,o){
	do{
		groups[i].pos=o;
		if(latest[nodes[i].val]==i){
			final[o++]=nodes[i].val;
		}
		if(nodes[i].next){
			o=f(nodes[i].next,o);
		}
		groups[i].len=o-groups[i].pos;
	}while(i=nodes[i].sib);
	return o;
}

main(){
	char*rp=mmap(0l,14l+21l*200000+32,1,2,0,0ll);
	RD(n);
	RD(m);
	for(int i=0;i<=n;++i){
		latest[i]=i;
		nodes[i].val=i;
		nodes[i].sib=i+1;
	}
	nodes[n].sib=0;
	for(int j=0;j<m;++j){
		RD(a);
		RD(b);
		RD(k);
		moves[j].k=k;
		int la=n+1+j;
		int lb=latest[b];
		moves[j].prev=latest[a];
		latest[a]=la;
		nodes[la].val=a;
		nodes[la].next=0;
		nodes[la].sib=nodes[lb].next;
		nodes[lb].next=la;
	}
	f(1,1);
	char*wp=wbuf;
	for(int j=0;j<m;++j){
		int k=moves[j].k;
		int p1=groups[j+(n+1)].pos;
		int le=groups[j+(n+1)].len;
		int p0=groups[moves[j].prev].pos;
		k+=p0<p1?
		k>=p0&k<p1+le?k<p0+le?p1-p0:-le:0:
		k>=p1&k<p0?le+(k<p0-le?0:p1-p0):0;
		int z=final[k];
		long d=10;
		int n=1;
		while(++n,d=d<<8|0x30|z%10,z/=10);
		*(long*)wp=d;
		wp+=n;
	}
	write(1,wbuf,wp-wbuf);
	_exit(0);
}