#include<bits/stdc++.h>
using namespace std;
long long n,q,root[210000*40],a[210000],b[210000],top,l,r,k;
struct xzh
{
	int l,r,sum;
}tree[210000*40];
int build(int p,int l,int r)
{
	top++;
	p=top;
	if(l==r)return p;
	int mid=(l+r)/2;
	tree[p].l=build(tree[p].l,l,mid);
	tree[p].r=build(tree[p].r,mid+1,r);
	return p;
}
int change(int p,int l,int r,int x)
{
	top++;
	tree[top]=tree[p];
	tree[top].sum++;
	if(l==r)return top;
	int mid=(l+r)/2;
	if(x<=mid)tree[top].l=change(tree[p].l,l,mid,x);
	else tree[top].r=change(tree[p].r,mid+1,r,x);
	return top;
}
int ask(int ll,int rr,int l,int r,int k)
{
	int x=tree[tree[rr].l].sum-tree[tree[ll].l].sum;
	if(l==r)return b[l];
	int mid=(l+r)/2;
	if(x>=k)return ask(tree[ll].l,tree[rr].l,l,mid,k);
	else return ask(tree[ll].r,tree[rr].r,mid+1,r,k-x);
}
int main()
{
	cin>>n>>q;
	for(int i=1;i<=n;i++)cin>>a[i],b[i]=a[i];
	sort(b+1,b+1+n);
	int cnt=unique(b+1,b+1+n)-b;
	root[0]=build(root[0],1,cnt);
	for(int i=1;i<=n;i++)
	{
		a[i]=lower_bound(b+1,b+1+cnt,a[i])-b;
		root[i]=change(root[i-1],1,cnt,a[i]);
	}
	while(q--)
	{
		cin>>l>>r>>k;
		cout<<ask(root[l-1],root[r],1,cnt,k)<<endl;
	}
	return 0;
}