#include <cstdio>
using namespace std;
int n,m,arb[400001];
int Maxim(int a,int b)
{
if(a > b)
return a;
return b;
}
void Creare(int Node,int Low,int High,int pos,int Val)
{
if(Low == High)
{
arb[Node] = Val;
}
else
{
int Mid = (Low+High)/2;
if(pos <= Mid)
Creare(2*Node,Low,Mid,pos,Val);
else
Creare(2*Node+1,Mid+1,High,pos,Val);
arb[Node] = Maxim(arb[2*Node] , arb[2*Node+1]);
}
}
int Querry(int Node,int Low,int High,int qA,int qB)
{
int Mid,R1=-1,R2=-1;
if(qA <= Low && High <= qB)
return arb[Node];
Mid = (Low+High)/2;
if(qA <= Mid)
R1 = Querry(2*Node,Low,Mid,qA,qB);
else
R2 = Querry(2*Node+1,Mid+1,High,qA,qB);
return Maxim(R1,R2);
}
void Read()
{
FILE *f=fopen("arbint.in","r");
FILE *g=fopen("arbint.out","w");
int cer,a1,b1,aux;
fscanf(f,"%i %i",&n,&m);
for(int i=1;i<=n;i++)
{
fscanf(f,"%i",&aux);
Creare(1,1,n,i,aux);
}
for(int i=0;i<m;i++)
{
fscanf(f,"%i %i %i",&cer,&a1,&b1);
if(cer == 1)
Creare(1,1,n,a1,b1);
else
fprintf(g,"%i\n",Querry(1,1,n,a1,b1));
}
}
int main()
{
Read();
return 0;
}