#include <bits/stdc++.h>

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

const int NMax = 262148;
const int INF = 0x3f3f3f3f;

int mx,n,m,x,y,p;
int TR[NMax];


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