//
// Created by xingchaoyue on 2019/9/10.
//
#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
const int maxn = 2e5+1000;
const int M = maxn*30;
int t[maxn];
int lson[M],rson[M],c[M];
int T[maxn];
int a[maxn];
int m;
int tot = 0;
int n;
void init_hash(int n){
for(int i = 1;i<=n;++i){
t[i] = a[i];
}
sort(t+1,t+n+1);
m = unique(t+1,t+n+1) - t - 1;
}
int build(int l,int r){
int root = tot++;
c[root] = 0;
if(l!=r){
int mid = (l + r)>>1;
lson[root] = build(l,mid);
rson[root] = build(mid+1,r);
}
return root;
}
int update(int root, int pos, int val){
int newroot = tot++;
int tmp = newroot;
c[newroot] = c[root]+val;
int l = 1,r = m;
while(l<r){
int mid = (l+r)>>1;
if(pos<=mid){
lson[newroot] = tot++;
rson[newroot] = rson[root];
newroot = lson[newroot];
root = lson[root];
r = mid;
}
else{
rson[newroot] = tot++;
lson[newroot] = lson[root];newroot = rson[newroot];
root = rson[root];
l = mid+1;
}
c[newroot] = c[root] + val;
}
return tmp;
}
int query(int lr, int rr, int k){
int l = 1,r = m;
while(l<r){
int mid = (l+r)>>1;
if(c[lson[lr]] - c[lson[rr]]>=k){
r = mid;
lr = lson[lr];
rr = lson[rr];
}
else{
l = mid+1;
k-= (c[lson[lr]] - c[lson[rr]]);
lr = rson[lr];
rr = rson[rr];
}
}
return l;
}
int hashs(int x){
return lower_bound(t+1,t+1+m,x)- t;
}
int main(){
int q;
tot = 0;
scanf("%d%d",&n,&q);
for(int i = 1;i<=n;++i){
scanf("%d",&a[i]);
}
init_hash(n);
T[n+1] = build(1,m);
for(int i = n;i>0;i--){
int pos = hashs(a[i]);
T[i] = update(T[i+1],pos,1);
}
for(int i = 1;i<=q;++i){
int l,r,k;
scanf("%d%d%d",&l,&r,&k);
printf("%d\n",t[query(T[l],T[r+1],k)]);
}
// }
}