#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("arbint.in");
ofstream fout("arbint.out");
int n, m, x, y, z, val, pos;
int v[400100];
int stanga, dreapta, maxim;
void update(int nod, int st, int dr) {
    if(st == dr){
        v[nod] = val;
    } else {
        int mid = (st + dr) / 2;
        if(mid >= pos) {
            update(2*nod, st, mid);
        } else {
            update(2*nod + 1, mid + 1, dr);
        }
        v[nod] = max(v[2 * nod], v[2 * nod + 1]);
    }
}
void query(int nod, int st, int dr) {
    if(st >= stanga && dr <= dreapta) {
        maxim = max(maxim, v[nod]);
    } else {
        int mid = (st + dr) / 2;
        if(mid < dreapta) query(2*nod + 1, mid + 1, dr);
        if(mid >= stanga) query(2*nod, st, mid);
    }
}
int main()
{
    fin>>n>>m;
    for(int i = 1; i <= n; i++) {
        fin>>x;
        val = x;
        pos = i;
        update(1, 1, n);
    }
    for(int j = 1; j <= m; j++) {
        fin>>x>>y>>z;
        if(x == 0) {
            stanga = y;
            dreapta = z;
            maxim = -1;
            query(1, 1, n);
            fout<<maxim<<'\n';
        } else {
            val = z;
            pos = y;
            update(1, 1, n);
        }
    }
    fin.close();
    fout.close();
    return 0;
}