#include <bits/stdc++.h>

using namespace std;

#define NMAX 100005

int n, m;
int arb[4 * NMAX];

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, int &maxim)
{
	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, maxim);
	if(mij < b)
		query(2 * nod + 1, mij + 1, right, a, b, maxim);
}

int main()
{
    freopen("arbint.in", "r", stdin);
    freopen("arbint.out", "w", stdout);
    cin >> n >> m;
	for (int i = 1; i <= n; i++) {
		int x;
		cin >> x;
		update(1, 1, n, i, x);
	}
	for (int i = 1; i <= m; i++) {
		int type, a, b;
		cin >> type >> a >> b;
		if (type == 0) {
			int maxim = -1;
			query(1, 1, n, a, b, maxim);
			cout << maxim << '\n';
		} else {
			update(1, 1, n, a, b);
		}
	}
    return 0;
}