//Null 的正确姿势终于学会啦qaq、、、

#include<cstdio>

#include<cstring>

#include<cctype>

#include<algorithm>

using namespace std;

#define rep(i,s,t) for(int i=s;i<=t;i++)

#define dwn(i,s,t) for(int i=s;i>=t;i--)

#define clr(x,c) memset(x,c,sizeof(x))

int read(){

	int x=0;char c=getchar();

	while(!isdigit(c)) c=getchar();

	while(isdigit(c)) x=x*10+c-'0',c=getchar();

	return x;

}

const int nmax=5e4+5;

const int inf=0x7f7f7f7f;

struct node{

	int sm;node *l,*r;

	node():sm(0){};

};

node ns[nmax*35],*pt=ns,*rt[nmax],*Null;

node* update(node *t,int x,int cur){

	node *p=pt++;p->sm=t->sm+1;

	if(cur<0) return p;

	int tp=(x>>cur)&1;

	if(tp) p->l=t->l,p->r=update(t->r,x,cur-1);

	else p->r=t->r,p->l=update(t->l,x,cur-1);

	return p;

}

int query(node *t,node *s,int x,int cur){

	if(cur<0) return 0;

	int tp=((x>>cur)&1)^1;

	if(!tp){

		if(t->l->sm==s->l->sm) return query(t->r,s->r,x,cur-1);

	    return (1<<cur)+query(t->l,s->l,x,cur-1);

	}else{

		if(t->r->sm==s->r->sm) return query(t->l,s->l,x,cur-1);

		return (1<<cur)+query(t->r,s->r,x,cur-1);

	}

}

int main(){

	int n=read(),m=read(),u,v,d;

	Null=pt++;Null->l=Null->r=Null;

	rt[0]=Null;rt[1]=update(rt[0],0,30);

	rep(i,1,n) u=read(),rt[i+1]=update(rt[i],u,30);

	rep(i,1,m){

		d=read(),u=read()+1,v=read()+1;

		printf("%d\n",query(rt[v+1],rt[u],d,30));

	}

	return 0;

}