#include <bits/stdc++.h>

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

const int NMax = 131074;

int n,m,sol,x,e,a,b;
int TR[NMax];

void update(int node, int l, int r, int p, int val){
    if(l > p || r < p)
        return;
    if(l == r && r == p){
        TR[node] = val;
        return;
    }
    int mid = (l + r) / 2;
    update(2 * node, l, mid, p, val);
    update(2 * node + 1, mid + 1, r, p, val);
    TR[node] = max(TR[2 * node],TR[2 * node + 1]);
}
void query(int node, int l, int r, int a, int b){
    if(l > b || r < a)
        return;
    if(a <= l && r <= b){
        sol = max(sol,TR[node]);
        return;
    }
    int mid = (l + r) / 2;
    query(2 * node, l, mid, a,b);
    query(2 * node + 1, mid + 1, r, a,b);
}
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 >> e;
        if(e == 0){
            f >> a >> b;
            sol = 0;
            query(1,1,n,a,b);
            g << sol << '\n';
        }else{
            f >> a >> b;
            update(1,1,n,a,b);
        }
    }
    return 0;
}