#include <bits/stdc++.h>

using namespace std;

const int N = 100000 + 7;
int n, q, t[4 * N];

void upd(int v, int tl, int tr, int i, int x) {
	if (tr < i || i < tl) {
		return;
	}
	if (tl == tr) {
		t[v] = x;
		return;
	}
	int tm = (tl + tr) / 2;
	upd(2 * v, tl, tm, i, x);
	upd(2 * v + 1, tm + 1, tr, i, x);
	t[v] = max(t[2 * v], t[2 * v + 1]);
}

int get(int v, int tl, int tr, int l, int r) {
	if (tr < l || r < tl) {
		return -1;
	}
	if (l <= tl && tr <= r) {
		return t[v];
	}
	int tm = (tl + tr) / 2;
	return max(get(2 * v, tl, tm, l, r), get(2 * v + 1, tm + 1, tr, l, r));
}

int main() {
#ifdef INFOARENA
	freopen ("arbint.in", "r", stdin);
	freopen ("arbint.out", "w", stdout);
#endif
	
	cin >> n >> q;
	for (int i = 1; i <= n; i++) {
		int x;
		cin >> x;
		upd(1, 1, n, i, x);
	}
	while (q--) {
		int type;
		cin >> type;
		assert(type == 0 || type == 1);
		if (type == 0) {
			int l, r;
			cin >> l >> r;
			cout << get(1, 1, n, l, r) << "\n";
		} else {
			int a, b;
			cin >> a >> b;
			upd(1, 1, n, a, b);
		}
	}

	return 0;
}