/* Arbori de intervale */

#include<cstdio>
#include<cstring>
#define in "arbint.in"
#define out "arbint.out"
using namespace std;

int n,m,c,x,y,maxnr,i;
int tree[1<<19+3];

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

void update(int nod,int st,int dr,int val,int poz)
{if(poz==st && poz==dr)
   tree[nod]=val;
 else
  {int mij=(st+dr)/2;
   if(mij>=poz)
      update(2*nod,st,mij,val,poz);
   if(mij<poz)
      update(2*nod+1,mij+1,dr,val,poz);
   tree[nod]=maxim(tree[2*nod+1],tree[2*nod]);  
  }  
}

void search(int nod, int st, int dr, int begin, int end)
{if(begin<=st && dr<=end)
   {if(maxnr<tree[nod])
    maxnr=tree[nod];}
 else
 {int mij=(st+dr)/2;   
 if(begin<=mij)  search(2*nod,st,mij,begin,end);
 if(mij<end) search(2*nod+1,mij+1,dr,begin,end);
}
}

int nrc;
char buff[1000000];

int get_number()
{int nrn=0;
 while(buff[nrc]<='9' && buff[nrc]>='0')
    {nrn=nrn*10+buff[nrc]-'0';
     nrc++;}
 return nrn;           
}

int main()
{freopen(in,"r",stdin);
freopen(out,"w",stdout);
nrc=0;
gets(buff);
n=get_number();
nrc++;
m=get_number();
nrc=0;
gets(buff);
for(i=1; i<=n; i++)
  {c=get_number();
   nrc++;
   update(1,1,n,c,i);}
for(i=1; i<=m; i++)
{nrc=0;
 gets(buff);
 c=get_number();
 nrc++;
 x=get_number();
 nrc++;
 y=get_number();
if(c==0)
{maxnr=0;
 search(1,1,n,x,y);
 printf("%d\n",maxnr);}
if(c==1)
{
 update(1,1,n,y,x);}
}   
   
return 0;}