from collections import deque
import bisect
n, m=map(int, input().split())
a=[0]*m
b=[0]*m
k=[0]*m
c=[i for i in range(n)]
cr=[0]*(n+m)
for i in range(n):
    cr[i]=i
g=[[] for i in range(n+m)]
pr=[0]*m
for i in range(m):
    a[i], b[i], k[i]=map(int, input().split())
    a[i]-=1
    b[i]-=1
    g[c[b[i]]].append(i+n)
    pr[i]=c[a[i]]
    c[a[i]]=i+n
    cr[i+n]=a[i]
st=[]
l=[0]*(n+m)
r=[0]*(n+m)
rev=[0]*(n+m)
t=0
for i in range(n):
    st.append(i)
    while len(st)!=0:
        x=st.pop()
        if len(st)==0:
            if i<n-1:
                r[x]=i+1
            else:
                r[x]=n+m
        else:
            r[x]=st[len(st)-1]
        l[x]=t
        rev[t]=x
        t+=1
        for y in g[x]:
            st.append(y)
for i in range(n+m):
    if r[i]<n+m:
        r[i]=l[r[i]]
cnt=[0]*(n+m+1)
cntr=[0]*(n+1)
for i in range(n+m):
    cnt[i+1]=cnt[i]
    if c[cr[rev[i]]]==rev[i]:
        cnt[i+1]+=1
        cntr[cnt[i+1]]=i
for i in range(m):
    l1=l[i+n]
    r1=r[i+n]
    l2=l[pr[i]]
    ans=0
    if l1<l2:
        if k[i]<=cnt[l1] or k[i]>cnt[l2]:
            ans=cr[rev[cntr[k[i]]]]
        elif k[i]<=cnt[l1]+cnt[l2]-cnt[r1]:
            ans=cr[rev[cntr[k[i]-cnt[l1]+cnt[r1]]]]
        else:
            ans=cr[rev[cntr[k[i]-cnt[l2]+cnt[r1]]]]
    else:
        if k[i]<=cnt[l2] or k[i]>cnt[r1]:
            ans=cr[rev[cntr[k[i]]]]
        elif k[i]<=cnt[l2]+cnt[r1]-cnt[l1]:
            ans=cr[rev[cntr[k[i]-cnt[l2]+cnt[l1]]]]
        else:
            ans=cr[rev[cntr[k[i]-cnt[r1]+cnt[l1]]]]
    print(ans+1)