#include <stdio.h>
#include <fstream>
#include <assert.h>  
using namespace std;

#define IN "arbint.in"
#define OUT "arbint.out"
#define dim 100001

ifstream fin(IN);
ofstream fout(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,int,int);
void Query(int,int,int);

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;
     start = A, finish = B;
     Query(1,1,N);

     fout<<maxim<<endl;        
    }
    else
    {
     Pos = A, Val = B;
     Update(1,1,N);
    } 
  }
  fin.close();
  fout.close();
return 0;  
}

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);
}