#include <cstdio>
#include <algorithm>
using namespace std;
#define Max 1<<18
#define lf (2*n)
#define rt (2*n+1)

int n,a[Max],x,y,rs;

void update(int n,int l,int r)
{
    if(l==r)
    {
        a[n]=y;
        return;
    }
        int m=(l+r)/2;
        if(x<=m)update(lf,l,m); else update(rt,m+1,r);
        a[n]=max(a[lf],a[rt]);
}

void query(int n,int l,int r)
{
    if(x<=l && r<=y)
    {
        rs=max(rs,a[n]);
        return;
    }
        int m=(l+r)/2;
        if(x<=m)query(lf,l,m);
        if(y>m)query(rt,m+1,r);
}

int main()
{
    int m,c;
    freopen("arbint.in","r",stdin);
    freopen("arbint.out","w",stdout);
        scanf("%d %d",&n,&m);
        for(int i=1;i<=n;i++)
        {
            x=i;
            scanf("%d",&y);
            update(1,1,n);
        }
       // for(int i=1;i<=20;i++)printf("%d ",a[i]); printf("\n");
        while(m--)
        {
            scanf("%d %d %d",&c,&x,&y);
            if(c==1)update(1,1,n); else
            {
                rs = 0;
                query(1,1,n);
                printf("%d\n",rs);
            }
        }
    return 0;
}