#include <fstream>
using namespace std;

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

int arb[400050], v[100005], n, m, t, a, b, maxim;

void query(int st, int dr, int nod, int a, int b) {
    if(a <= st && dr <= b) {
        maxim = max(maxim, arb[nod]);
        return;
    }

    int m = (st+dr)/2;
    if(m >= a)query(st, m, 2*nod, a, b);
    if(m < b) query(m+1, dr, 2*nod+1 ,a , b);
}

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

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

int main() {
    citire();
    while(m--) {
        fin >> t >> a >> b;
        if(!t) {
            maxim = -2e9;
            query(1, n, 1, a, b);
            fout << maxim << '\n';
        }
        else update(1, n, 1, a, b);
    }
}