#include <fstream>
#include <algorithm>

#define NMAX 100001

using namespace std;

ifstream fin("arbint.in");
ofstream fout("arbint.out");

int arb[NMAX];
int n, m;

int query(int node, int left, int right, int a, int b) {
	int m = 0;
	if (a <= left && b >= right) {
		return arb[node];
	}
	int mid = (left + right) / 2;
	if (a <= mid) {
		m = query(2 * node, left, mid, a, b);
	}
	if (b > mid) {
		m = max(m, query(2 * node + 1, mid + 1, right, a, b));
	}
	return m;
}

void update(int node, int left, int right, int a, int y) {
	if (left == right) {
		arb[node] = y;
		return;
	}
	int mid = (left + right) / 2;
	if (a <= mid) {
		update(2 * node, left, mid, a, y);
	} else {
		update(2 * node + 1, mid + 1, right, a, y);
	}
	arb[node] = max(arb[2 * node], arb[2 * node + 1]);
}
int main() {
	int val;
	fin >> n >> m;
	for (int i = 1; i <= n; ++i) {
		fin >> val;
		update(1, 1, n, i, val);
	}
	int op, x, y;
	for (int i = 0; i < m; ++i) {
		fin >> op >> x >> y;
		if (op == 0) {
			fout << query(1, 1, n, x, y) << endl;
		} else {
			update(1, 1, n, x, y);
		}
	}
	return 0;
}