#include <iostream>
#include <fstream>

using namespace std;

ifstream fin("arbint.in");
ofstream fout("arbint.out");

const int NMAX = 100005;
int v[NMAX], tree[4 * NMAX];

void update(int nod, int le, int ri, int pos, int val) {
    if (le == ri) {
        v[pos] = val;
        tree[nod] = val;
        return;
    }

    int mid = (le + ri) / 2;
    if (pos <= mid) {
        update(2 * nod, le, mid, pos, val);
    } else {
        update(2 * nod + 1, mid + 1, ri, pos, val);
    }

    tree[nod] = max(tree[2 * nod], tree[2 * nod + 1]);
}

int query(int nod, int le, int ri, int a, int b) {
    if (a <= le && ri <= b) {
        return tree[nod];
    }

    int res = 0;
    int mid = (le + ri) / 2;

    if (a <= mid) {
        res = max(res, query(2 * nod, le, mid, a, b));
    }
    if (mid < b) {
        res = max(res, query(2 * nod + 1, mid + 1, ri, a, b));
    }

    return res;
}

int main() {

    int n, q;
    fin >> n >> q;
    for (int i = 1; i <= n; i++) {
        fin >> v[i];
        update(1, 1, n, i, v[i]);
    }

    while (q--) {
        int cer, a, b;
        fin >> cer >> a >> b;
        if (cer == 0) {
            fout << query(1, 1, n, a, b) << '\n';
        } else {
            update(1, 1, n, a, b);
        }
    }

    return 0;
}