/* Arbori de intervale */
#include<cstdio>
#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 main()
{freopen(in,"r",stdin);
freopen(out,"w",stdout);
scanf("%d %d",&n,&m);
for(i=1; i<=n; i++)
{scanf("%d",&c);
update(1,1,n,c,i);}
for(i=1; i<=m; i++)
{scanf("%d",&c);
if(c==0)
{maxnr=0;
scanf("%d %d",&x,&y);
search(1,1,n,x,y);
printf("%d\n",maxnr);}
if(c==1)
{scanf("%d %d",&x,&y);
update(1,1,n,y,x);}
}
return 0;}