#include <bits/stdc++.h>

using namespace std;

ifstream f("arbint.in");
ofstream g("arbint.out");

const int NMAX = 1e5 + 5;
int n,m,arb[4 * NMAX],v[NMAX],ans;

void build(int nod, int st, int dr){
    int mid;
    if(st == dr)
        f >> arb[nod];
    else{
        mid = (st + dr) / 2;
        build(2 * nod, st, mid);
        build(2 * nod + 1, mid + 1, dr);
        arb[nod] = max(arb[2 * nod], arb[2 * nod + 1]);
    }
}

void query(int nod, int st, int dr, int x, int y){
    int mid ;
    if(st >= x && y >= dr)
        ans = max(ans, arb[nod]);
    else{
        mid = (st + dr) / 2;
        if(x <= mid)
            query(2 * nod, st, mid, x, y);
        if(mid + 1 <= y)
            query(2 * nod + 1, mid + 1, dr, x ,y);
    }
}

void update(int nod, int st, int dr, int x, int y){
    int mid;
    if(st == dr){
        arb[nod] = y;
        return;
    }
    mid = (st + dr) / 2;
    if(x <= mid)
        update(2 * nod, st, mid, x, y);
    if(x > mid)
        update(2 * nod + 1, mid + 1, dr, x, y);
    arb[nod] = max(arb[2 * nod], arb[2 * nod + 1]);
}

int main(){
    int i,q,x,y;
    f >> n >> m;
    build(1, 1, n);

    for(i = 1 ; i <= m ; i++){
        f >> q >> x >> y;
        if(q == 0){
            ans = 0;
            query(1,1,n,x,y);
            g << ans << "\n";
        }else
            update(1,1,n,x,y);
    }

    return 0;
}