#include<fstream>
#include<cstdio>
#include<set>
#include<vector>
#include<algorithm>
#define FOR(a,b,c) for(int a=b;a<=c;++a)
#include<cstring>
#include<bitset>
#include<cmath>
#include<iomanip>
#include<queue>
#define f cin
#define g cout
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define mod 1000000007
#define ll unsigned long long
#define bit (1<<18)
#define inf 1000000
#define N 400100
#define mod 1000000007
#define inu "arbint.in"
#define outu "arbint.out"
using namespace std;
ifstream f(inu);
ofstream g(outu);
//int dx[]={0,0,0,1,-1};
//int dy[]={0,1,-1,0,0};
int H[N],sol,a,n,m,b,t;
void upd(int st,int dr,int po)
{
	if(st==dr)
	{
		H[po]=b;
		return ;
	}
	int mij=(st+dr)>>1;
	if(a<=mij)
		upd(st,mij,po<<1);
	else
		upd(mij+1,dr,(po<<1)+1);
	H[po]=max(H[po<<1],H[(po<<1)+1]);
}
void find(int st,int dr,int po)
{
	if(st>=a&&dr<=b)
	{
		sol=max(sol,H[po]);
		return;
	}
	int mij=(st+dr)>>1;
	if(a<=mij)
		find(st,mij,po<<1);
	if(b>mij)
		find(mij+1,dr,(po<<1)+1);
}
int main ()
{
	f>>n>>m;
	FOR(i,1,n)
	{
		f>>b;
		a=i;
		upd(1,n,1);
	}
	FOR(i,1,m)
	{
		f>>t;
		if(t)
		{
			f>>a>>b;
			upd(1,n,1);
		}
		else
		{
			sol=0;
			f>>a>>b;
			find(1,n,1);
			g<<sol<<"\n";
		}
	}
	return 0;
}