#include <bits/stdc++.h>
using namespace std;
ifstream fin("arbint.in");
ofstream fout("arbint.out");
const int INF = 1e9;
int n, m;
vector<int>tree;
void build() {
    tree = vector<int>(2 * n + 4);
    for(int i = 0, x; i < n; i++) {
        fin >> x;
        tree[i + n] = x;
    }
    for(int i = n - 1; i > 0; i--) {
        tree[i] = max(tree[i << 1], tree[(i << 1) + 1]);
    }
}
void update(int k, int value) {
    k += n;
    tree[k] = value;
    for(k >>= 1; k > 0; k >>= 1) {
        tree[k] = max(tree[k << 1], tree[(k << 1) + 1]);
    }
}
int query(int a, int b) {
    int ret = -INF;
    a += n; b += n;
    for(; a <= b; a >>= 1, b >>= 1) {
        if(a & 1) {
            ret = max(ret, tree[a++]);
        }
        if(!(b & 1)) {
            ret = max(ret, tree[b--]);
        }
    }
    return ret;
}
int main() {
    fin >> n >> m;
    build();
    for(int c, a, b; m--; ) {
        fin >> c >> a >> b;
        a--; b--;
        if(c == 0) {
            fout << query(a, b) << '\n';
        } else {
            update(a, b + 1);
        }
    }
    return 0;
}