program kthtree;

type

  point=record

     l,r,s:longint;

   end;

var

  t:array[..*]of point;

  a,b,id,root:array[..]of longint;

  n,i,m,x,y,k,v,len:longint;

procedure qsort(l,h:longint);

var i,j,t,m:longint;

begin i:=l; j:=h;

 m:=a[(i+j) div ];

 repeat

while a[i]<m do inc(i);

while m<a[j] do dec(j);

if i<=j then

  begin   t:=a[i]; a[i]:=a[j]; a[j]:=t; t:=id[i];id[i]:=id[j]; id[j]:=t;

inc(i); dec(j);  end;  until i>j;

 if i<h then qsort(i,h); if j>l then qsort(l,j);  end;

procedure add(l,r,v:longint; var p:longint);

var mid:longint;

begin

  inc(len); t[len]:=t[p]; p:=len; inc(t[p].s);

  if l=r then exit;

  mid:=(l+r) div ;

  if v<=mid then add(l,mid,v,t[p].l) else add(mid+,r,v,t[p].r);

end;

function query(x,y,l,r,k:longint):longint;

var mid,s:longint;

begin

  if l=r then exit(l);

  mid:=(l+r) div ; s:=t[t[y].l].s-t[t[x].l].s;

  if  k<=s then exit(query(t[x].l,t[y].l,l,mid,k))

    else exit(query(t[x].r,t[y].r,mid+,r,k-s));

end;

begin

  readln(n,m);

  for i:= to n* do t[i].s:=;

  for i:= to n do begin read(a[i]); id[i]:=i; end;

  qsort(,n);

  for i:= to n do b[id[i]]:=i;

  len:=;

  for i:= to n do

   begin

     root[i]:=root[i-];

     add(,n,b[i],root[i]);

   end;

  for i:= to m do

   begin

     readln(x,y,k);

     writeln(a[query(root[x-],root[y],,n,k)]);

   end;

end.