#include <fstream>

using namespace std;
int constexpr nMax = 100010;
int v[nMax], aint[4 * nMax];
int n, m, c;

int query(int nod, int st, int dr, int qSt, int qDr) {
    if (st >= qSt && dr <= qDr) {
        return aint[nod];
    }
    int mid = (st + dr) / 2;
    if (qDr <= mid) {
        return query(nod * 2, st, mid, qSt, qDr);
    }
    if (mid + 1 <= qSt) {
        return query(nod * 2 + 1, mid + 1, dr, qSt, qDr);
    }
    return max(query(nod * 2, st, mid, qSt, qDr), query(nod * 2 + 1, mid + 1, dr, qSt, qDr));
}

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

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

int main() {
    ifstream fin("arbint.in");
    ofstream fout("arbint.out");
    fin >> n >> m;
    for (int i = 1; i <= n; i++) {
        fin >> v[i];
    }
    build(1, 1, n);
    for (int i = 1; i <= m; i++) {
        fin >> c;
        if (!c) {
            int st, dr;
            fin >> st >> dr;
            fout << query(1, 1, n, st, dr) << "\n";
        } else {
            int poz, val;
            fin >> poz >> val;
            update(1, 1, n, poz, val);
        }
    }
    return 0;
}