#include<stdio.h>
#include<string.h>
#define max(a,b)((a)>(b)?(a):(b))
FILE*fin=fopen("arbint.in","r");
FILE*fout=fopen("arbint.out","w");
int n,m,s[100001],t[300000];
void update(int nod,int st,int dr,int a,int b)
{
	if(st<dr)
	{
		int mij=(st+dr)/2;
		if(a<=mij) update(nod*2,st,mij,a,b);
		else update(nod*2+1,mij+1,dr,a,b);
		t[nod]=max(t[nod*2],t[nod*2+1]);
	}
	else t[nod]=b;
}
int query(int nod,int st,int dr,int a,int b)
{
	int v1=0,v2=0;
	if(a<=st&&dr<=b)
		return t[nod];
	else
	{
		int mij=(st+dr)/2;
		if(a<=mij) v1=query(nod*2,st,mij,a,b);
		if(b>=mij+1) v2=query(nod*2+1,mij+1,dr,a,b);
		return max(v1,v2);
	}
}
int main()
{
	int i,o,a,b;
	fscanf(fin,"%d%d",&n,&m);
	for(i=1;i<=n;i++)
		fscanf(fin,"%d",&s[i]);
	memset(t,0,sizeof(t));
	for(i=1;i<=n;i++)
		update(1,1,n,i,s[i]);
	for(i=1;i<=m;i++)
	{
		fscanf(fin,"%d%d%d",&o,&a,&b);
		if(o) update(1,1,n,a,b);
		else fprintf(fout,"%d\n",query(1,1,n,a,b));
	}
	fclose(fin);
	fclose(fout);
return 0;}