program aa;
var
a,b,c,d,e,f,i,j,m,n,max,sum:longint;
f1,f2:text;
l,t:array[1..100000] of longint;
//*************************************
procedure Sort(z, r: longint);
var
  i, j, x, y: longint;
begin
  i := z; j := r; x := t[(z+r) DIV 2];
  repeat
    while t[i] < x do i := i + 1;
    while x < t[j] do j := j - 1;
    if i <= j then
    begin
      y := t[i]; t[i] := t[j]; t[j] := y;
      i := i + 1; j := j - 1;
    end;
  until i > j;
  if z < j then Sort(z, j);
  if i < r then Sort(i, r);
end;
//*************************************
begin
 assign(f1,'kth.in');
 assign(f2,'kth.out');
 reset(f1);
 rewrite(f2);
 readln(f1,n,m);
 for i:=1 to n do
  read(f1,l[i]);
 readln(f1);
 for i:=1 to m do
 begin
  readln(f1,a,b,c);
  for j:=a to b do
   t[j]:=l[j];
  sort(a,b);
  writeln(f2,t[a+c-1]);
 end;
 close(f1);
 close(f2);
end.