#include <stdio.h>
#include <limits.h>


#define Nmax 4*100001

long A[Nmax];


void update(long,long,long,long,long);
long maxkeres(long,long,long,long,long);
long max(long,long);

long n,m,type,b,c;

int main()
{
    freopen("arbint.in","r",stdin);
    freopen("arbint.out","w",stdout);

    scanf("%ld %ld",&n,&m);
    for (int i = 1; i<=n; i++)
    {
        scanf("%ld",&b);
        update(1,1,n,i,b);
    }
    for (int i = 1; i<=m; i++)
    {
        scanf("%ld %ld %ld",&type,&b,&c);
        if (type == 0)
        {
            printf("%ld\n",maxkeres(1,1,n,b,c));
        }
        else update(1,1,n,b,c);
    }
    return 0;
}

void update(long cs,long e, long v, long p, long er)
{
    long k = (e+v)/2;
    if (e==v)
    {
        A[cs] = er;
    }
    else if (p>k)
    {
        update(2*cs+1,k+1,v,p,er);
        A[cs] = max(A[2*cs],A[2*cs+1]);
    }
    else if (p<=k)
    {
        update(2*cs,e,k,p,er);
        A[cs] = max(A[2*cs],A[2*cs+1]);
    }
}

long maxkeres(long cs, long e, long v, long ee, long vv)
{
    long k = (e+v)/2;
    if ((e == ee) && (v == vv))
        return A[cs];
    else if ((ee<=k) && (vv<=k))
        return maxkeres(2*cs,e,k,ee,vv);
    else if ((ee>k) && (vv>k))
        return maxkeres(2*cs+1,k+1,v,ee,vv);
    else
        return max(maxkeres(2*cs,e,k,ee,k),maxkeres(2*cs+1,k+1,v,k+1,vv));
}

long max(long a, long b)
{
    return (a>b?a:b);
}