真的弘文的，不知道哪里错了，调一天了啊。

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define re register
#define il inline
#define pii pair<int,int>
#define x first
#define y second
#define gc getchar()
#define rd read()
#define debug() puts("------------")

namespace yzqwq{
    il int read(){
        int x=0,f=1;char ch=gc;
        while(ch<'0'||ch>'9'){if(ch=='-') f=-1;ch=gc;}
        while(ch>='0'&&ch<='9') x=(x<<1)+(x<<3)+(ch^48),ch=gc;
        return x*f;
    }
    il int qmi(int a,int b,int p){
        int ans=1;
        while(b){
            if(b&1) ans=ans*a%p;
            a=a*a%p,b>>=1;
        }
        return ans;
    }
    il int gcd(int a,int b){
        if(!b) return a;
        return gcd(b,a%b);
    }
    il int lcm(int a,int b){
        return a/gcd(a,b)*b;
    }
    il void exgcd(int a,int b,int &x,int &y){
        if(!b) return x=1,y=0,void(0);
        exgcd(b,a%b,x,y);
        int t=x;
        x=y,y=t-a/b*x;
        return ;
    }
    il int F(int n,int a,int b,int c){
        //sum{|_ (ai+b)/c _| i:0~n}
        if(!n) return b/c;
        if(!a) return (n+1)*(b/c);
        if(a>=c||b>=c){
            int x=a/b,y=b/c;
            return n*(n+1)/2*x+(n+1)*y+F(n,a%c,b%c,c);
        }
        int m=(a*n+b)/c;
        return n*m+F(m-1,c,c-b+1,a);
    }
    struct lb{
        int d[64];
        il void print(){
            for(re int i=0;i<63;++i)
            if(d[i]) printf("%lld:%lld\n",i,d[i]);
            return ;
        }
        lb(){memset(d,0,sizeof(d));}
        il void operator +=(int x){
            for(re int i=62;i>=0;--i){
                if(!(x&(1ll<<i))) continue;
                if(d[i]) x^=d[i];
                else return d[i]=x,void(0);
            }
            return ;
        }
        int& operator [](int x){
            return d[x];
        }
        il void operator +=(lb &x){
            for(re int i=62;i>=0;--i)
            if(x[i]) *this+=x[i];
            return ;
        }
        il friend lb operator +(lb &x,lb &y){
            lb z=x;
            for(re int i=62;i>=0;--i)
            if(y[i]) z+=y[i];
            return z;
        }
        il int Max_calc(){
            int ans=0;
            for(re int i=62;i>=0;--i)
            if((ans^d[i])>ans) ans^=d[i];
            return ans;
        }
    };
    mt19937 rnd(time(0));
}
using namespace yzqwq;
#define id(x) ((x-1)/len+1)
//#define L(x) ((x-1)*len+1)
//#define R(x) (min(n,x*len))

const int N=4e5+10,M=635;
int n,m,a[N],len;
priority_queue<int,vector<int>,greater<int>> qmin[M];
priority_queue<int> qmax[M];

il void rebuild(int k){
	for(re int i=(k-1)*len+1;i<=min(n,k*len);++i){
		qmin[k].push(a[i]);
		a[i]=qmin[k].top();
		qmin[k].pop();
	}
	while(!qmin[k].empty()) qmin[k].pop();
	while(!qmax[k].empty()) qmax[k].pop();
	for(re int i=(k-1)*len+1;i<=min(n,k*len);++i) qmax[k].push(a[i]);
	return ;
}
il int query(int l,int r,int x){
	int bl=id(l),br=id(r);
	if(bl==br){
		rebuild(bl);
		for(re int i=l;i<=r;++i)
			if(a[i]>x) swap(x,a[i]);
		return x;
	}
	rebuild(bl);
	for(re int i=l;i<=bl*len;++i)
		if(a[i]>x) swap(x,a[i]);
	for(re int i=bl+1;i<=br-1;++i){
		qmax[i].push(x),qmin[i].push(x);
		x=qmax[i].top();
		qmax[i].pop();
	}
	rebuild(br);
	for(re int i=(br-1)*len+1;i<=r;++i)
		if(a[i]>x) swap(x,a[i]);
	return x;
}

il void solve(){
	n=rd,m=rd,len=sqrt(n);
	for(re int i=1;i<=n;++i){
		a[i]=rd;
		qmax[id(i)].push(a[i]);
	}
	while(m--){
		int l=rd,r=rd,x=rd;
		if(l<=r) printf("%lld\n",query(l,r,x));
		else printf("%lld\n",query(1,r,query(l,n,x)));
	}
    return ;
}

signed main(){
//	freopen(".in","r",stdin);
//	freopen(".out","w",stdout);
    int t=1;while(t--)
    solve();
    return 0;
}