#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
int read() {
	int s=0,f=1;
	char ch=getchar();
	for( ; ch<'0'||ch>'9'; f=(ch=='-')?-1:f,ch=getchar()) ;
	for( ; ch>='0'&&ch<='9'; s=s*10+(ch^48),ch=getchar()) ;
	return s*f;
}
int n,m,cnt,num,A[1000005],Hash[1000005],ls[20000005],rs[20000005],rt[1000005],sum[20000005];
void update(int &x,int Last,int pos,int l,int r) {
	x=++cnt;
	ls[x]=ls[Last],rs[x]=rs[Last],sum[x]=sum[Last]+1;
	if(l==r) return; 
	int mid=l+r>>1;
	if(pos<=mid) update(ls[x],ls[Last],pos,l,mid);
	else update(rs[x],rs[Last],pos,mid+1,r);
}
int query(int x,int y,int l,int r,int k) {
	if(l==r) return l;
	int mid=l+r>>1,Rank=sum[ls[y]]-sum[ls[x]];
	if(k<=Rank) return query(ls[x],ls[y],l,mid,k);
	else return query(rs[x],rs[y],mid+1,r,k-Rank);
}
int qsy() {
	freopen("kthnumber.in","r",stdin);
	freopen("kthnumber.out","w",stdout);
	n=read(),m=read();
	for(int i=1; i<=n; Hash[i]=A[i]=read(),++i) ;
	sort(Hash+1,Hash+n+1),num=unique(Hash+1,Hash+n+1)-Hash-1;
	for(int i=1; i<=n; ++i) A[i]=lower_bound(Hash+1,Hash+num+1,A[i])-Hash,update(rt[i],rt[i-1],A[i],1,num);
	for(int l,r,k,i=1; i<=m; ++i) l=read(),r=read(),k=read(),printf("%d\n",Hash[query(rt[l-1],rt[r],1,num,k)]);
	return 0;
}
int wpy=qsy();
int main() {
	;
}