#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cctype>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <stack>
#include <cassert>
using namespace std;

#define PRO "arbint"
void OpenFiles(int EVAL)
{
	if(EVAL)
	{
		char input[100] = PRO, output[100] = PRO;
		freopen(strcat(input, ".in"),"r",stdin);
		freopen(strcat(output,".out"),"w",stdout);
	} else
	{
		freopen("test.in","r",stdin);
		freopen("test.out","w",stdout);
	}
}

#define MAX 100001
#define INF 0xffffff

int n,a[1<<18],x,y,rasp;

void Update(int n,int l,int r)
{
	if(l==r)
	{
		a[n]=y;
		return;
	}
	int m=(l+r)/2;
	if(x<=m)Update(2*n,l,m); else
			Update(2*n+1,m+1,r);
	a[n]=max(a[2*n],a[2*n+1]);
}

void Query(int n,int l,int r)
{
	if(x<=l && r<=y)
	{
		rasp=max(rasp,a[n]);
		return;
	}
	int m=(l+r)/2;
	if(x<=m)Query(2*n,l,m);
	if(y>m)Query(2*n+1,m+1,r);
}

int main(int argv,char *args[])
{
	int m,op;
	OpenFiles(argv==0);
	// start
		scanf("%d %d",&n,&m);
		for(int i=1;i<=n;i++)
		{
			scanf("%d",&y);
			x=i;
			Update(1,1,n);
		}
		//for(int i=1;i<=2*n;i++)printf("%d ",a[i]);
		for(int i=1;i<=m;i++)
		{
			scanf("%d %d %d",&op,&x,&y);
			switch(op)
			{
			case 1: Update(1,1,n); break;
			case 0: rasp=0;
					Query(1,1,n);
					printf("%d\n",rasp); break;
			}
		}
		return 0;
}