#include <fstream>
using namespace std;

ifstream f("arbint.in");
ofstream g("arbint.out");

int n, m, op, a, b, v[400005];

void build(int nod, int st, int dr) {
    if (st == dr) {
        f >> v[nod];
        return;
    }
    int mid = (st + dr) / 2;
    build(2 * nod, st, mid);
    build(2 * nod + 1, mid + 1, dr);
    v[nod] = max(v[2 * nod], v[2 * nod + 1]);
}

void update(int nod, int st, int dr, int pos, int val) {
    if (st == dr) {
        v[nod] = val;
        return;
    }
    int mid = (st + dr) / 2;
    if (pos <= mid) update(2 * nod, st, mid, pos, val);
    else update(2 * nod + 1, mid + 1, dr, pos, val);
    v[nod] = max(v[2 * nod], v[2 * nod + 1]);
}

int query(int nod, int st, int dr, int l, int r) {
    if (l <= st && dr <= r) return v[nod];
    int mid = (st + dr) / 2, sol = 0;
    if (l <= mid) sol = query(2 * nod, st, mid, l, r);
    if (r > mid) sol = max(sol, query(2 * nod + 1, mid + 1, dr, l, r));
    return sol;
}

int main() {
    f >> n >> m;
    build(1, 1, n);
    for (int i = 1; i <= m; i++) {
        f >> op >> a >> b;
        if (op == 0) g << query(1, 1, n, a, b) << "\n";
        else update(1, 1, n, a, b);
    }
    return 0;
}