#include <bits/stdc++.h>

std::ifstream in("arbint.in");
std::ofstream out("arbint.out");

void build(int node, int l, int r, std::vector<int>& aint, std::vector<int>& v) {
    if (l == r) {
        aint[node] = v[l];
    } else {
        int m = (l + r) / 2;
        build(2 * node, l, m, aint, v);
        build(2 * node + 1, m + 1, r, aint, v);
        aint[node] = std::max(aint[2 * node], aint[2 * node + 1]);
    }
}

void update(int node, int l, int r, std::vector<int>& aint, int pos, int x) {
    if (l == r) {
        aint[node] = x;
    } else {
        int m = (l + r) / 2;
        if (pos <= m) {
            update(2 * node, l, m, aint, pos, x);
        } else {
            update(2 * node + 1, m + 1, r, aint, pos, x);
        }

        aint[node] = std::max(aint[2 * node], aint[2 * node + 1]);
    }
}

int query(int node, int l, int r, std::vector<int>& aint, int a, int b) {
    if (r < a || l > b) {
        return 0;
    }

    if (l >= a && r <= b) {
        return aint[node];
    }

    int m = (l + r) / 2;

    return std::max(query(2 * node, l, m, aint, a, b), query(2 * node + 1, m + 1, r, aint, a, b));
}

int main() {
    int n, m;
    in >> n >> m;

    std::vector<int> v(n + 1);
    std::vector<int> aint(4 * n + 4, 0);

    for (int i = 1; i <= n; i++) {
        in >> v[i];
    }

    build(1, 1, n, aint, v);

    for (int i = 1; i <= m; i++) {
        int op, a, b;
        in >> op >> a >> b;
        if (op == 0) {
            out << query(1, 1, n, aint, a, b) << '\n';
        } else {
            update(1, 1, n, aint, a, b);
        }
    }
}