#include<fstream>
#include<algorithm>
using namespace std;
 
int i,n,m,aux,x,y,arb[400000];
 
  void update(int left, int right, int nod)
  {
    int pivot;   
    if(right==left) {arb[nod]=y; return ;}
    else {
           if(y>arb[nod]) arb[nod]=y;
           pivot=(left+right)/2;
           if(x<=pivot) update(left,pivot,2*nod);
           else update(pivot+1,right,2*nod+1);
         } 
  }
   
  int query(int x, int y, int left, int right, int nod)
  {
    int pivot;  
    if(x==left && y==right) return arb[nod];
    else {
           pivot=(left+right)/2;
           if(x>pivot) return query(x,y,pivot+1,right,2*nod+1);
           else if(pivot>=y) return query(x,y,left,pivot,2*nod);
                else return max(query(x,pivot,left,pivot,2*nod),query(pivot+1,y,pivot+1,right,2*n+1));
         }    
  }
 
int main()
{
  ifstream cin("arbint.in");
  ofstream cout("arbint.out"); 
   
  cin>>n>>m;
  for(i=1;i<=n;i++) cin>>y,x=i,update(1,n,1);
   
  while(m--)
  {
    cin>>aux>>x>>y;
    if(aux==0) cout<<query(x,y,1,n,1)<<'\n';
    else update(1,n,1);       
  } 
     
 return 0;   
}