#include <bits/stdc++.h> using namespace std; #define N 1000009 #define oo 1000000001 int n, q, a[N], it[4 * N]; void build(int i, int l, int r) { if (l == r) { it[i] = a[l]; return; } int il = (i << 1), mid = (l + r) >> 1; build(il, l, mid); build(il + 1, mid + 1, r); it[i] = max(it[il], it[il + 1]); } void update(int i, int l, int r, int p, int x) { // neu p khong nam trong [l,r] thi bo qua // p la chi so cu, x la gia tri can thay if (l > p || r < p) return; if (l == r) { it[i] = x; return; } int il = (i << 1), mid = (l + r) >> 1; // neu p nho hon mid thi xet ben trai if (p <= mid) update(il, l, mid, p, x); // neu p lon hon mid thi xet ben phai else update(il + 1, mid + 1, r, p, x); // cap nhat lai it it[i] = max(it[il], it[il + 1]); } int query(int i, int l, int r, int u, int v) { if (v < l || r < u) return -oo; if (u <= l && r <= v) return it[i]; int il = (i << 1), mid = (l + r) >> 1; return max(query(il, l, mid, u, v), query(il + 1, mid + 1, r, u, v)); } int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n >> q; for (int i = 1; i <= n; i++) cin >> a[i]; build(1, 1, n); int t, u, v; while (q--) { cin >> t >> u >> v; if (t == 1) update(1, 1, n, u, v); else cout << query(1, 1, n, u, v) << " "; } return 0; }