#include<stdio.h>
long n,m,arb[400100],val,pos,max,start,finish;
FILE*f;
long Max(long a,long b)
{
	if(a>b)return a;
	return b;
}
void update(long nod,long left,long right)
{
	if(left==right)
	{
		arb[nod]=val;
		return;
	}
	long div=(left+right)/2;
	if(pos<=div)update(nod*2,left,div);
	else update(nod*2+1,div+1,right);

	arb[nod]=Max(arb[nod*2],arb[nod*2+1]);
}
void query(long nod,long left,long right)
{
	if(start<=left&&right<=finish)
	{
		if(arb[nod]>max)max=arb[nod];
		return;
	}
	long div=(left+right)/2;
	if(start<=div)query(nod*2,left,div);
	if(div<finish)query(nod*2+1,div+1,right);
}
void read()
{
	f=fopen("arbint.in","r");
	fscanf(f,"%ld%ld",&n,&m);
	long i=1;
	for(;i<=n;++i)
	{
		fscanf(f,"%ld",&val);
		pos=i;
		update(1,1,n);
	}
}
int main()
{
	read();
	long st,dr;
	int c;
	FILE*g=fopen("arbint.out","w");
	for(;m;--m)
	{
	   fscanf(f,"%d %ld%ld",&c,&st,&dr);
	   if(!c)
	   {
		   max=-1;
		   start=st;finish=dr;
		   query(1,1,n);
		   fprintf(g,"%ld\n",max);
	   }
	   else
	   {
		   pos=st;
		   val=dr;
		   update(1,1,n);
	   }
	}
	fclose(f);
	fclose(g);
	return 0;
}