#include<cstdio>

using namespace std;

const int nmax=100005;

int arb[4*nmax+66];
int pos,val,start,finish,maxim=-1;
inline int max(int a,int b)
{
    if(a>b)
        return a;
    return b;
}

inline void update(int node,int st,int dr)
{
    int med;
    if(st==dr)
    {
        arb[node]=val;
        return;
    }
    med=(st+dr)/2;
    if(pos<=med)
        update(2*node,st,med);
    else
        update(2*node+1,med+1,dr);
    arb[node]=max(arb[2*node],arb[2*node+1]);
}

inline void query(int node,int st,int dr)
{
    if(start<=st&&dr<=finish)
    {
        if(maxim<arb[node])
            maxim=arb[node];
        return;
    }
    int med=(st+dr)/2;
    if(start<=med)
        query(2*node,st,med);
    if(finish>med)
        query(2*node+1,med+1,dr);
}

int main()
{
    freopen("arbint.in","r",stdin);
    freopen("arbint.out","w",stdout);
    int n,m,i,j,x;
    scanf("%d%d",&n,&m);
    for(i=1;i<=n;++i)
    {
        scanf("%d",&x);
        pos=i;
        val=x;
        update(1,1,n);
    }
    int op,y;
    for(i=1;i<=m;++i)
    {
        scanf("%d%d%d",&op,&x,&y);
        if(op)
        {
            pos=x;
            val=y;
            update(1,1,n);
        }
        else
        {
            maxim=-1;
            start=x;
            finish=y;
            query(1,1,n);
            printf("%d\n",maxim);
        }
    }
}