#include <cstdio>
#include <algorithm>
#define nmax 100009
using namespace std;
int arb[4*nmax],v[nmax],n;
void update(int poz,int x,int val,int inc,int sf)
{
    if(inc==sf)
    {
        arb[poz]=val;
    }
    else
    {
        int med=(inc+sf)/2;
        if(x<=med)
        {
            update(poz*2,x,val,inc,med);
        }
        else
        {
            update(poz*2+1,x,val,med+1,sf);
        }
        arb[poz]=max(arb[poz*2],arb[poz*2+1]);
    }
}
int query(int poz,int st,int dr,int inc,int sf)
{
    if(inc>=st&&sf<=dr)
        return arb[poz];
    int med=(inc+sf)/2;
    if(st<=med&&dr>med)
        return max(query(poz*2,st,med,inc,med),
                   query(poz*2+1,med+1,dr,med+1,sf));
    if(st<=med)
        return query(poz*2,st,dr,inc,med);
    return query(poz*2+1,st,dr,med+1,sf);
}
int main()
{
    freopen("arbint.in","r",stdin);
    freopen("arbint.out","w",stdout);
    int i,m,op,x,y;
    scanf("%d%d",&n,&m);
    for(i=1;i<=n;i++)
    {
        scanf("%d",&v[i]);
        update(1,i,v[i],1,n);
    }
    for(i=1;i<=m;++i)
    {
        scanf("%d",&op);
        if(op==1)
        {
            scanf("%d%d",&x,&y);
            update(1,x,y,1,n);
        }
        if(op==0)
        {
            scanf("%d%d",&x,&y);
            printf("%d\n",query(1,x,y,1,n));
        }
    }
    return 0;
}