#include <cstdio>
using namespace std;

#define in "arbint.in"
#define out "arbint.out"
const int dim=100004;

int N, M;
int A[4*dim+66];
int start, stoop, Val, Pos, maxim;

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

void Update(int nod, int st, int dr)
{
     if ( st == dr )
     {
          A[nod] = Val;
          return;
     }

     int mij = (st+dr)/2;
     if ( Pos <= mij ) Update(2*nod,st,mij);
     else              Update(2*nod+1,mij+1,dr);

     A[nod] = Maxim( A[2*nod], A[2*nod+1] );
}

void Query(int nod, int st, int dr)
{
     if ( start <= st and dr <= stoop )
     {
          if ( maxim < A[nod] ) maxim = A[nod];
          return;
     }

     int mij = (st+dr)/2;
     if ( start <= mij ) Query(2*nod,st,mij);
     if ( mij < stoop ) Query(2*nod+1,mij+1,dr);
}

int main()
{
    int X,tip, A, B;
    freopen(in,"r",stdin);
    freopen(out,"w",stdout);

    scanf("%d%d", &N, &M);
    for ( int i = 1; i <= N; i++ )
    {
        scanf("%d", &X);
        Pos = i;  Val = X;
        Update(1,1,N);
    }

    for ( int i = 1; i <= M; i++ )
    {
        scanf("%d%d%d", &tip, &A, &B);
        if ( tip == 0 )
        {
             maxim = -1;
             start = A;
             stoop = B;
             Query(1,1,N);

             printf("%d\n", maxim);
        }
        else
        {
            Pos = A;
            Val = B;
            Update(1,1,N);
        }
    }
}