#include <bits/stdc++.h> 
using namespace std;
ifstream fin ("arbint.in");
ofstream fout ("arbint.out");
#define dim 100001
 
int N, M;
int MaxArb[400070];
int prim, ult, 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 )
     {
          MaxArb[nod] = Val;
          return;
     }
     
     int div = (st+dr)/2;
     if ( Pos <= div ) Update(2*nod,st,div);
     else              Update(2*nod+1,div+1,dr);
     
     MaxArb[nod] = Maxim( MaxArb[2*nod], MaxArb[2*nod+1] );
}

void Query(int nod, int st, int dr)
{
     if ( prim<=st && dr<=ult )
     {
          if ( maxim < MaxArb[nod] ) maxim = MaxArb[nod];
          return;
     }
     
     int div = (st+dr)/2;
     if ( prim<=div ) Query(2*nod,st,div);
     if ( div<ult ) Query(2*nod+1,div+1,dr);
}
 
int main()
{
    int X, A, B;
    fin>>N>>M;
    for ( int i = 1; i <= N; i++ )
    {
        fin>>X;
        Pos = i, Val = X;
        Update(1,1,N);
    }   
    
    for ( int i = 1; i <= M; i++ )
    {
        fin>>X>>A>>B;
        if ( X == 0 ) 
        {
             maxim = -1;
             prim= A; ult= B;
             Query(1,1,N);
             fout<<maxim<<endl;
        }
        else
        {
            Pos = A, Val = B;
            Update(1,1,N);
        }
    }
    return 0;
}