/*
    Look at me!
    Look at me!
    The monster inside me has grown this big!
*/

#include<fstream>
#include<iostream>
#include<cstdio>
#include<map>
#include<set>
#define FIT(a,b) for(vector<int >::iterator a=b.begin();a!=b.end();a++)
#define RIT(a,b) for(vector<int>::reverse_iterator a=b.end();a!=b.begin();++a)
#include<stack>
#define ROF(a,b,c) for(int a=b;a>=c;--a)
#include<vector>
#include<algorithm>
#define FOR(a,b,c) for(int a=b;a<=c;++a)
#define REP(a,b) for(register int a=0;a<b;++a)
#include<cstring>
#include<bitset>
#include<cmath>
#include<iomanip>
#include<queue>
#define debug cerr<<"OK";
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define ll long long
#define ull unsigned long long
#define eps 1.e-6
#define N 100100
using namespace std;
/*int dx[]={0,0,0,1,-1};
int dy[]={0,1,-1,0,0};*/
ifstream f("arbint.in");
ofstream g("arbint.out");
int H[N<<2],v[N],n,m,x,y,sol,tip;
void build(int st,int dr,int po)
{
	if(st==dr)
	{
		H[po]=v[st];
		return ;
	}
	int mij=(st+dr)>>1;
	build(st,mij,po<<1);
	build(mij+1,dr,(po<<1)+1);
	H[po]=max(H[po<<1],H[(po<<1)+1]);
}
void upd(int st,int dr,int po)
{
	if(st==dr)
	{
		H[po]=x;
		return ;
	}
	int mij=(st+dr)>>1;
	if(x<=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 query(int st,int dr,int po)
{
	if(st>=x&&dr<=y)
	{
		sol=max(sol,H[po]);
		return ;
	}
	int mij=(st+dr)>>1;
	if(x<=mij)
		query(st,mij,po<<1);
	if(y>mij)
		query(mij+1,dr,(po<<1)+1);
}
int main ()
{
	f>>n>>m;
	FOR(i,1,n)
	f>>v[i];
	build(1,n,1);
	FOR(i,1,m)
	{
		f>>tip;
		if(!tip)
		{
			f>>x>>y;
			sol=0;
			query(1,n,1);
			g<<sol<<"\n";
		}
		else
		{
			f>>x>>y;
			upd(1,n,1);
		}
	}
	return 0;
}