#include<fstream>
using namespace std;

ifstream f("okey.in");
ofstream g("okey.out");
int task;
int vec[4*100001+66];
int n,m;
int position=0;
int maxim=-1,start,stop;
int valoare=0;
int max(int a,int b)
{
    return (b>a)? b:a;
}
void Update(int nod, int left, int right)
{
     if ( left == right )
     {
          vec[nod] = valoare;
          return;
     }

     int div = (left+right)/2;
     if ( position <= div )
        Update(2*nod,left,div);
     else
        Update(2*nod+1,div+1,right);

     vec[nod] = max( vec[2*nod], vec[2*nod+1] );
}
void interogare(int nod, int left, int right)
{
     if ( start <= left && right <= stop )
     {
          if ( maxim < vec[nod] )
            maxim = vec[nod];
          return;
     }

     int div = (left+right)/2;
     if ( start <= div )
        interogare(2*nod,left,div);
     if ( div < stop )
     interogare(2*nod+1,div+1,right);
}
int main(){
    f>>n>>m;
    int a,b;
    int i=0;
    for(int i=1;i<=n;i++)
    {
       f>>valoare;
       position=i;
       Update(1,1,n);

    }

    for(int i=1;i<=m;i++)
    {
        f>>task>>start>>stop;
        if(task)
        {
            valoare=stop;
            position=start;
            Update(1,1,n);
        }
        else{
            maxim=-1;
            interogare(1,1,n);
            g<<maxim<<"\n";
        }
    }


}