#include<cstdio>
#include<algorithm>
using namespace std;
const int MAXN=400005;
int n,m,maxim,pos,val,start,finish;
int arb[MAXN];
void update(int node, const int left, const int right)
{
	if (left==right)
	{
		arb[node]=val;
		return;
	}
	int mid=left+(right-left)/2;
	if (pos<=mid)	update(node*2,left,mid);
	else			update(node*2+1,mid+1,right);

	arb[node]=max(arb[node*2],arb[node*2+1]);
}
void query(int node, const int left, const int right)
{
	if (start<=left && finish>=right)
	{
		if (arb[node]>maxim)
			maxim=arb[node];
		return;
	}

	int mid=left+(right-left)/2;
	if (start<=mid)	query(node*2,left,mid);
	if (finish>mid)	query(node*2+1,mid+1,right);
}
int main()
{
	int op,x,y;
	freopen("arbint.in","r",stdin);
	freopen("arbint.out","w",stdout);
	scanf("%d%d",&n,&m);
	for (int i=1; i<=n; ++i)
	{
		scanf("%d",&x);
		pos=i;	val=x;
		update(1,1,n);
	}
	for (int i=1; i<=m; ++i)
	{
		maxim=-1;
		scanf("%d%d%d",&op,&x,&y);
		if (!op)
		{
			start=x;	finish=y;
			query(1,1,n);
			printf("%d\n",maxim);
		}
		else
		{
			pos=x;	val=y;
			update(1,1,n);
		}
	}
	return 0;
}