#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream f("arbint.in");
ofstream g("arbint.out");
int n, m, x, y, op, pozitie;
int arbore[400000];

void update(int nod, int stanga, int dreapta, int pozitie, int valoare){
    if (stanga == dreapta){
        arbore[nod] = valoare;
        return;
    }
    int mid = (dreapta+stanga)/2;
    if (pozitie <= mid) update(2*nod, stanga, mid, pozitie, valoare);
    else{
        update(2*nod + 1, mid+1, dreapta, pozitie, valoare);
    }
    arbore[nod] = max(arbore[2*nod], arbore[2*nod  + 1]);
}

int query(int nod, int stanga, int dreapta, int start, int end){
    if (stanga >= start && end >= dreapta)
        return arbore[nod];
    int mid = (dreapta + stanga) / 2;
    int max_prima_jumatate = 0, max_doua_jumatate = 0;
    if (start <= mid)
        max_prima_jumatate = query(2*nod, stanga, mid, start, end);
    if (mid < end)
        max_doua_jumatate = query(2*nod, mid + 1, dreapta, start, end);
    if (max_prima_jumatate > max_doua_jumatate)
        return max_prima_jumatate;
    return max_doua_jumatate;
}


int main(){
    f >> n >> m;
    for (int i = 1; i <= n; i ++){
        f >> x;
        update(1, 1, n, i, x);
    }
    for (int i = 1; i <= m; i ++){
        f >> op;
        if (op == 0){
            f >> x >> y;
            g << query(1,1,n,x,y) << endl;
        }
        else{
            f >> x >> y;
            update(1,1,n,x,y);
        }
    }
    return 0;
}