#include <fstream>
using namespace std;

const int dim=100001;
int N, M;
int arb[4*dim+66];
int start, finish, val, pos, maxi;

ifstream cin("arbint.in");
ofstream cout("arbint.out");

inline int maxim(int a, int b) {
       if ( a > b ) return a;
       return b;
}

void update(int nod, int left, int right)
{
     if ( left == right )
     {
          arb[nod] = val;
          return;
     }

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

     arb[nod] = maxim(arb[2*nod], arb[2*nod+1]);
}

void query(int nod, int left, int right)
{
     if ( start <= left && right <= finish )
     {
          if ( maxi < arb[nod] ) maxi = arb[nod];
          return;
     }

     int div = (left+right)/2;
     if ( start <= div ) query(2*nod,left,div);
     if ( div < finish ) query(2*nod+1,div+1,right);
}

int main()
{
    int X, A, B;
    cin>>N>>M;
    for ( int i = 1; i <= N; i++ )
    {
        cin>>X;
        pos = i, val = X;
        update(1,1,N);
    }

    for ( int i = 1; i <= M; i++ )
    {
        cin>>X>>A>>B;
        if ( X == 0 )
        {
             maxi = -1;
             start = A, finish = B;
             query(1,1,N);
             cout<<maxi<<'\n';
        }
        else
        {
            pos = A, val = B;
            update(1,1,N);
        }
    }
}