#include <cstdio>
#include <cstdlib>
#include <algorithm>
using namespace std;
const int nmax=100007;
int n,m;
struct arb
{
    int val;
    struct arb* sfiu;
    struct arb* dfiu;
};
struct arb* root;
struct arb* newnode()
{
    struct arb* x=(struct arb*)malloc(sizeof(struct arb));
    x->sfiu=NULL;
    x->dfiu=NULL;
    x->val=0;
    return x;
};
void update(struct arb* &node,int st,int dr,int pos,int val)
{
    if(st==dr) node->val=val;
    else
    {
        int mij=(st+dr)/2;
        if(pos<=mij)
        {
            if(node->sfiu==NULL) node->sfiu=newnode();
            update(node->sfiu,st,mij,pos,val);
        }
        else
        {
            if(node->dfiu==NULL) node->dfiu=newnode();
            update(node->dfiu,mij+1,dr,pos,val);
        }
        node->val=0;
        if(node->dfiu!=NULL&&node->val<node->dfiu->val) node->val=node->dfiu->val;
        if(node->sfiu!=NULL&&node->val<node->sfiu->val) node->val=node->sfiu->val;
    }
}
int query(struct arb* node,int st,int dr,int p1,int p2)
{
    if(p1==st&&p2==dr) return node->val;
    else
    {
        int maxim=0;
        int mij=(st+dr)/2;
        if(p2<=mij&&node->sfiu!=NULL) maxim=query(node->sfiu,st,mij,p1,p2);
        else if(p1>mij&&node->dfiu!=NULL) maxim=query(node->dfiu,mij+1,dr,p1,p2);
        else
        {
            if(node->sfiu!=NULL) maxim=max(maxim,query(node->sfiu,st,mij,p1,mij));
            if(node->dfiu!=NULL) maxim=max(maxim,query(node->dfiu,mij+1,dr,mij+1,p2));
        }
        return maxim;
    }
}
int main()
{
    freopen ("arbint.in","r",stdin);
    freopen ("arbint.out","w",stdout);
    root=newnode();
    scanf("%d%d",&n,&m);
    for(int i=1;i<=n;i++)
    {
        int v;
        scanf("%d",&v);
        update(root,1,n,i,v);
    }
    int x,y,z;
    for(int i=1;i<=m;i++)
    {
        scanf("%d%d%d",&x,&y,&z);
        if(x==1) update(root,1,n,y,z);
        else printf("%d\n",query(root,1,n,y,z));
      //  printf("%d\n",root->val);
    }
}