#include <stdio.h>
#include <algorithm>
#define arb_size 270000
using namespace std;

int n,m,A[arb_size],p[100001],v[100001];

void buildAint(int k,int a,int b)
{
    if (a==b)
        A[k]=v[a],p[a]=k;
    else
    {
        int m=(a+b)>>1;

        buildAint(k<<1,a,m);
        buildAint((k<<1)+1,m+1,b);
        A[k]=max(A[k<<1],A[(k<<1)+1]);
    }
}

int query(int k,int x,int y,int a,int b)
{
	if (a<=x && y<=b)
		return A[k];
	else
	{
		int m=(x+y)>>1,w=-1;

		if (a<=m)
			w=max(w,query(k<<1,x,m,a,b));
		if (b>m)
			w=max(w,query((k<<1)+1,m+1,y,a,b));

		return w;
	}
}

void update(int k)
{
	A[k]=max(A[k<<1],A[(k<<1)+1]);
	if (k!=1)
		update(k>>1);
}

int main()
{
	int i,a,b,t;
	freopen ("arbint.in","r",stdin);
	freopen ("arbint.out","w",stdout);

	scanf("%i%i",&n,&m);
	for (i=1;i<=n;i++)
		scanf("%i",&v[i]);

    buildAint(1,1,n);

	for (i=1;i<=m;i++)
	{
		scanf("%i%i%i",&t,&a,&b);
		if (!t)
			printf("%i\n",query(1,1,n,a,b));
		else
		{
			v[a]=b;
			A[p[a]]=b;
			update(p[a]>>1);
		}
	}

	fclose(stdin);
	fclose(stdout);
	return 0;
}