#include <algorithm>
#include <stdio.h>

using namespace std;

void query(int *ai, int nod, int St, int Dr, int st, int dr);
void update(int *ai, int nod, int val, int pos, int st, int dr);
void build(int *ai, int *v, int nod, int st, int dr);

int Max = 0;

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

	int ai[100001 * 4 + 1] = {0};
	int v[100005];
	int n, m, x, y, z;
	
	scanf("%d%d",&n,&m);

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

	build(ai, v, 1, 1, n);

	for(int i=1; i<=m;++i) {
		scanf("%d%d%d",&x,&y,&z);
		if( x == 0){
			Max = 0;
			query(ai, 1, 1,n, y, z);
			printf("%d\n",Max);
		}
		else
			update(ai, 1, z, y, 1, n);
	}

	return 0;
}

void build(int *ai, int *v, int nod, int st, int dr)
{
	if( st == dr ) {
		ai[nod] = v[st];
		return;
	}
	
	int mij = (st+dr)>>1;
	build(ai,v, nod<<1, st, mij);
	build(ai, v, (nod<<1) +1, mij+1, dr);
	ai[nod] = max(ai[nod<<1] , ai[(nod<<1) +1]);
}

void update(int *ai, int nod, int val, int pos, int st, int dr)
{

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

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

void query (int *ai, int nod, int St, int Dr, int st, int dr) {
	int mij = (St + Dr)>>1;
	if ( st <= St && dr >= Dr) {
		Max = max(Max, ai[nod]);
		return;
	}
	if ( mij >= st ) 
		query(ai, nod<<1, St, mij, st, dr);
	if ( mij < dr)
		query(ai, (nod<<1) + 1, mij+1, Dr, st, dr);

}