#include <iostream>
#include <fstream>
#include <cmath>
#include <vector>
#include <algorithm>
#define For(i,a,b) for (int i=(a);i<=(b);++i)
#define dim 100001
using namespace std;
ifstream in("arbint.in");
ofstream out("arbint.out");
int N, M;
int MaxArb[4*dim+66];
int start, finish, Val, Pos, maxim;
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 )
     {
          MaxArb[nod] = Val;
          return;
     }

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

     MaxArb[nod] = Maxim( MaxArb[2*nod], MaxArb[2*nod+1] );
}
void Query(int nod, int left, int right)
{
     if ( start <= left && right <= finish )
     {
          if ( maxim < MaxArb[nod] ) maxim = MaxArb[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;
    in >>N>>M;
    For(i,1,N)
    {
        in >>X;
        Pos=i;
        Val=X;
        Update(1,1,N);
    }
    For(i,1,M)
    {
        in >>X>>A>>B;
         if ( X == 0 )
        {
             maxim = -1;
             start = A, finish = B;
             Query(1,1,N);
             out <<maxim;
        }
        else
        {
            Pos = A, Val = B;
            Update(1,1,N);
        }
    }
    return 0;
}