#include <fstream>
#include <algorithm>
#include <iostream>

using namespace std;

int ai[100001 * 4 + 1] = {0};
int val, pos;

int query(int nod, int St, int Dr, int st, int dr);
void update(int nod, int val, int pos, int st, int dr);

int main()
{
	ifstream in("arbint.in");
	ofstream out("arbint.out");

	int n, m, x, y, z;
	in>>n>>m;

	for(int i=1; i<=n; ++i) {
		in>>x;
		update(1, x, i, 1, n);
	}

	for(int i=1; i<=m;++i) {
		in>>x>>y>>z;
		if( x == 0)
			out<<query(1, 1,n, y, z)<<endl;
		else
			update(1, z, y, 1, n);
	}

	return 0;
}

void update(int nod, int val, int pos, int st, int dr)
{
	//cout<<nod<<" " << st <<" "<< dr <<endl;;
	//return;

	int mij = (dr + st)/2;
	if ( st == dr) { 
		ai[nod] = val;
		return;
	}

	if ( mij >= pos  ) 
		update( nod * 2, val, pos, st, mij );
	if ( mij < pos )
		update( nod *2 + 1, val, pos, mij+1, dr );
	
	ai[nod] = max( ai[nod*2], ai[nod*2 +1] );
}

int query (int nod, int St, int Dr, int st, int dr) {
	int mij = (St + Dr)/2;
	
	if ( St ==  Dr)
		return ai[nod];


	int l = 0, r = 0;
	if ( mij >= st ) 
		l = query(2*nod, St, mij, st, dr);
	if ( mij < dr)
		r = query(2*nod + 1, mij+1, Dr, st, dr);

	return max(l,r);
}