#include <stdio.h>
#define N 100005
using namespace std;
int M[4*N+66];
int n,m,pos,val,maxim,start,finish;
int x,a,b,i;
FILE *f,*g;
int maximul(int a, int b)
{
	if (a>b)
		return a;
	else
		return b;
}
void Update(int nod, int left, int right)
{
	if (left==right)
	{
		M[nod]=val;
		return;
	}
	int mij=(left+right)/2;
	if (pos<=mij)
		Update(2*nod,left,mij);
	else
		Update(2*nod+1,mij+1,right);
	M[nod]=maximul(M[2*nod],M[2*nod+1]);
}
void Query(int nod, int left, int right)
{
	if (start<=left && right<=finish)
	{
		if (maxim<M[nod])
			maxim=M[nod];
		return;
	}
	int mij;
	mij=(right+left)/2;
	if (start<=mij)
		Query(2*nod,left,mij);
	if (mij<finish)
		Query(2*nod+1,mij+1,right);
}
int main()
{
	f=fopen("arbint.in","r");
	g=fopen("arbint.out","w");
	fscanf(f,"%d %d",&n,&m);
	for (i=1;i<=n;++i)
	{
		fscanf(f,"%d",&x);
		pos=i;
		val=x;
		Update(1,1,n);
	}
	for (i=1;i<=m;++i)
	{
		fscanf(f,"%d %d %d",&x,&a,&b);
		if (x==0)
		{
			maxim=-1;
			start=a;
			finish=b;
			Query(1,1,n);
			fprintf(g,"%d\n",maxim);
		}
		else
		{
			pos=a;
			val=b;
			Update(1,1,n);
		}
	}
	fclose(f);
	fclose(g);
	return 0;
}