#include <cstdio>
#include <iostream>
#define Nmax 100001

using namespace std;
FILE *f1 = fopen("arbint.in","r");
FILE *f2 = fopen("arbint.out","w");
int n,m,i,ar[2*Nmax+1],x,p,max1,k,p1,p2;

void update(int nod,int st,int dr)
{int mij;
if (st==dr) ar[nod]=x;
else
{
mij=(st+dr)/2;
if (p<=mij && 2*nod<=2*n+1) update(2*nod,st,mij);
else if (2*nod+1<=2*n+1) update(2*nod+1,mij+1,dr);
ar[nod]=max(ar[2*nod],ar[2*nod+1]);
}
}

void query(int nod,int st,int dr,int a,int b)
{int mij;
if (a<=st && b>=dr) max1=ar[nod];
else
{mij=(st+dr)/2;
if (a<=mij && 2*nod<=2*n+1) query(2*nod,st,mij,a,b);
else if (b>mij && 2*nod+1<=2*n+1) query(2*nod+1,mij+1,dr,a,b);
}
}

int main()
{fscanf(f1,"%d%d",&n,&m);
for (i=1;i<=n;i++)
{fscanf(f1,"%d",&x);
p=i;
update(1,1,n);
}

for (i=1;i<=m;i++)
{fscanf(f1,"%d%d%d",&k,&p1,&p2);
if (k==0)
{query(1,1,n,p1,p2);
fprintf(f2,"%d\n",max1);
}
else
{p=p1;x=p2;
update(1,1,n);
}
}
fclose(f1);
fclose(f2);
    return 0;
}

//Challenges are what make life interesting and overcoming them is what makes life meaningful.