#include <fstream>
#include <vector>

using namespace std;

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

vector<int> arb;
int maxim = -1;


void update(int nod, int left, int right, int a, int b) {
    if (left == right) {
        arb[nod] = b;
        return;
    }

    int div = (left + right) / 2;
    if (a <= div) update(2 * nod, left, div, a, b);
    else update(2 * nod + 1, div + 1, right, a, b);

    if (arb[nod * 2] > arb[nod * 2 + 1])
        arb[nod] = arb[nod * 2];
    else
        arb[nod] = arb[nod * 2 + 1];
}


int query(int nod, int left, int right, int start, int finish) {
     if(start <= left && right <= finish) {
        if (maxim < arb[nod]) maxim = arb[nod];
        return arb[nod];
    }

    int div = (left + right) / 2;
    if (start <= div) maxim = query(2 * nod, left, div, start, finish);
    if (div < finish) maxim = query(2 * nod + 1, div + 1, right, start, finish);
    return maxim;
}

int main() {
    int n, m, x, op, a, b;
    arb.resize(400066);

    fin >> n >> m;

    for (int i = 0; i < n; i++) {
        fin >> x;
        update(1, 1, n, i + 1, x);
    }

    for (int i = 0; i < m; i++) {
        fin >> op;
        if (op == 0) {
            fin >> a >> b;
            maxim = -1;
            fout<<query(1,1,n,a,b)<<"\n";
        }
        else{
            fin>>a>>b;
            update(1,1,n,a,b);
        }
    }
}