program arbori;
var f,g:text;
    sir:array[1..100000] of longint;
    n,m,max,i,j,a,b,o:longint;
begin
     assign(f,'arbint.in');
     assign(g,'arbint.out');
     rewrite(g);
     reset(f);
     readln(f,n,m);
     for i:=1 to n do
       read(f,sir[i]);
     for i:=1 to m do
         begin
         readln(f,o,a,b);
         if o=0 then begin
                     max:=sir[a];
                     for j:=a+1 to b do
                       if sir[j]>max then max:=sir[j];
                     writeln(g,max);
                     end
               else sir[a]:=b;
        end;
     close(f);
     close(g);

end.