#include <bits/stdc++.h>
 
using namespace std;
 
#define NMAX 100005
 
int n, m;
int arb[4 * NMAX + 1000];
int maxim;
 
void update(int nod, int left, int right, int pos, int val)
{
	if (left == right) {
		arb[nod] = val;
		return;
	}
	int mij = (left + right) / 2; 
	if (pos <= mij)
		update(2 * nod, left, mij, pos, val);
	else
		update(2 * nod + 1, mij + 1, right, pos, val);
	arb[nod] = max(arb[2 * nod], arb[2 * nod + 1]);
}
 
void query(int nod, int left, int right, int a, int b)
{
	if (a <= left && right <= b) {
		if (maxim < arb[nod])
			maxim = arb[nod];
		return;
	}
	int mij = (left + right) / 2;
	if (a <= mij)
		query(2 * nod, left, mij, a, b);
	if(mij < b)
		query(2 * nod + 1, mij + 1, right, a, b);
}
 
int main()
{
    freopen("arbint.in", "r", stdin);
    freopen("arbint.out", "w", stdout);
	scanf("%d%d", &n, &m);
	for (int i = 1; i <= n; i++) {
		int x;
		scanf("%d", &x);
		update(1, 1, n, i, x);
	}
	for (int i = 1; i <= m; i++) {
		int type, a, b;
		scanf("%d%d%d", &type, &a, &b);
		if (type == 0) {
			memset(&maxim, 0, sizeof(maxim));
			query(1, 1, n, a, b);
			cout << maxim << '\n';
		} else {
			update(1, 1, n, a, b);
		}
	}
    return 0;
}