#include <bits/stdc++.h>
using namespace std;
const int N=400050;
const int S=447;
const int M=N/S+1;
set<int> pos[M];
multiset<pair<int,int>> st[M];
int a[N];
int Push(int B, int x)
{
st[B].insert({x,0});
int p;tie(x,p)=*st[B].rbegin();
st[B].erase(--st[B].end());
if(p) pos[B].insert(-p);
return x;
}
void BuildBlock(int B, int l, int r)
{
pos[B].clear();
for(int i=l;i<=r;i++) st[B].insert({a[i],-i});
}
void BreakBlock(int B)
{
while(st[B].size())
{
int p=-1;
if(pos[B].size()) p=*pos[B].rbegin(),pos[B].erase(--pos[B].end());
while(st[B].size() && -st[B].rbegin()->second>p)
{
a[-st[B].rbegin()->second]=st[B].rbegin()->first;
st[B].erase(--st[B].end());
}
if(~p)
{
int x,y;tie(x,y)=*st[B].rbegin();y=-y;
st[B].erase(--st[B].end());
if(y) pos[B].insert(y);
a[p]=x;
}
}
}
int n,q;
int Push(int B, int l, int r, int x)
{
BreakBlock(B);
for(int i=l;i<=r;i++) if(a[i]>x) swap(a[i],x);
BuildBlock(B,B*S,min((B+1)*S,n)-1);
return x;
}
void BuildAll(){ for(int l=0;l<n;l+=S) BuildBlock(l/S,l,min(l+S,n)-1);}
int Query(int l, int r, int x)
{
int L=l/S,R=r/S;
if(L==R)
{
x=Push(L,l,r,x);
}
else
{
x=Push(L,l,L*S+S-1,x);
for(int i=L+1;i<R;i++) x=Push(i,x);
x=Push(R,R*S,r,x);
}
return x;
}
int main()
{
scanf("%i %i",&n,&q);
for(int i=0;i<n;i++) scanf("%i",&a[i]);
BuildAll();
while(q--)
{
int l,r,x;
scanf("%i %i %i",&l,&r,&x);
l--;r--;
if(l<=r) x=Query(l,r,x);
else x=Query(0,r,Query(l,n-1,x));
printf("%i\n",x);
}
return 0;
}
