#include <cstdio>
#include <algorithm>
using namespace std;
int n,m,op,a,b,T[1<<19],x;
void update(int root, int left, int right, int poz, int value)
{
    if (left == poz && right == poz)
    {
        T[root] = value;
        return;
    }
    int  m = (left+right)>>1;
    if (poz <=m) update(root*2,left,m,poz,value);
    else update(root*2+1,m+1,right,poz,value);
    T[root]= max(T[root*2],T[root*2+1]);
}
int query(int root, int left, int right, int a, int b)
{
    int x1=0,x2=0;
    if(a <= left && b >= right ) return T[root];
   int  m = (left+right)/2;
    if(a<=m) x1 = query(root*2,left,m,a,b);
    if (b > m) x2 = query(root*2+1,m+1,right,a,b);
    return max(x1,x2);
}

int main()
{
    freopen("arbint.in","r",stdin);
    freopen("arbint.out","w",stdout);
    scanf("%d %d",&n,&m);

    for(int i=1 ; i<=n ;++i)
    {
        scanf("%d",&x);
        update(1,1,n,i,x);
    }
    for(int i=1;i<=m;++i)
    {
        scanf("%d %d %d",&op,&a,&b);
        if(op)
        {
            update(1,1,n,a,b);
        }
        else
        {
            printf("%d\n",query(1,1,n,a,b));
        }
    }

    return 0;
}