#include<cstdio>

#include<iostream>

#include<algorithm>

#define MAXN 100005

#define MAX 2000005

using namespace std;

int sum[MAX],l[MAX],mid[MAX],r[MAX],a[MAXN],b[MAXN],n,m,sz,size,root[MAXN],cnt;

void build(int &x,int z,int y)

{

     x=++sz;

     if(z==y){mid[sz]=-y;return;}

     mid[sz]=(z+y)>>;

     build(l[x],z,mid[x]);

     build(r[x],mid[x]+,y);

}

void update(int &x,int last,int to)

{

     x=++sz;

     mid[sz]=mid[last];

     sum[sz]=sum[last]+;

     if(mid[sz]<)return;

     l[sz]=l[last];

     r[sz]=r[last];

     if(to<=mid[x])update(l[x],l[last],to);

     else update(r[x],r[last],to);

}

int query(int x,int y,int k)

{

     if(mid[y]<)return b[-mid[y]];

     cnt=sum[l[y]]-sum[l[x]];

     if(k<=cnt)return query(l[x],l[y],k);

     else return query(r[x],r[y],k-cnt);

}

inline void work()

{

     int x,y,k;

     scanf("%d%d%d",&x,&y,&k);

     printf("%d\n",query(root[x-],root[y],k));

}

int main()

{

    freopen("kth.in","r",stdin);

    freopen("kth.out","w",stdout);

      scanf("%d%d",&n,&m);

      for(int i=;i<=n;i++){scanf("%d",&a[i]);b[i]=a[i];}

      sort(b+,b+n+);

      size=unique(b+,b+n+)-(b+);

      build(root[],,size);

      for(int i=;i<=n;i++){a[i]=lower_bound(b+,b+size+,a[i])-b;update(root[i],root[i-],a[i]);}

      while(m--)work();

    return ;

}