#include <iostream>
#include <fstream>
using namespace std;

int arbint[400000];
ifstream f("arbint.in");
ofstream g("arbint.out");


void update(int index, int start, int end,int poz, int val)
{
    if (start == end){
        arbint[index] = val;
        return;
    }
    int m = (start + end)/2;
    if(poz <= m)
        update(index*2, start, m,poz,val);
    else
        update(index*2+1, m+1, end,poz,val);

    arbint[index] = max(arbint[index*2], arbint[index*2+1]);
}

int query(int index, int start, int end, int l, int r)
{
    if ( end < l or start > r )
        return 0;
    if ( start >= l && end <= r )
        return arbint[index];
    int m = (start + end) / 2;
    int left_side = query(index*2, start, m, l, r);
    int right_side = query(index*2+1, m+1, end, l, r);
    return max(left_side, right_side);
}
int main()
{
    int n, m, x, cod, y;
    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 >> cod >> x >> y;
        if( cod == 0){
            g << query(1,1,n,x,y) << '\n';
        }
        else if( cod == 1){
            update(1,1,n,x,y);
        }
    }
    f.close();
    g.close();
    return 0;
}