#include <cstdio>
#include <cstdlib>
#include <algorithm>
const int nmax=100004;
using namespace std;
int n,m;
struct arb
{
    struct arb* sfiu;
    struct arb* dfiu;
    int val;
};
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->sfiu!=NULL&&node->sfiu->val > node->val) node->val=node->sfiu->val;
        if(node->dfiu!=NULL&&node->dfiu->val > node->val) node->val=node->dfiu->val;
    }
}
int query(struct arb* node,int st,int dr,int p1,int p2)
{
  //  if(node==NULL) {printf("%d %d\n",st,dr);return 0;}
    if(st==p1&&dr==p2) return node->val;
    else
    {
        int mij=(st+dr)/2;
        if(p2<=mij) return query(node->sfiu,st,mij,p1,p2);
        else if(p1>mij) return query(node->dfiu,mij+1,dr,p1,p2);
        return max(query(node->sfiu,st,mij,p1,mij),query(node->dfiu,mij+1,dr,mij+1,p2));
    }
}
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 val;
        scanf("%d",&val);
        update(root,1,n,i,val);
    }
    for(int i=1;i<=m;i++)
    {
        int tip,p1,p2;
        scanf("%d%d%d",&tip,&p1,&p2);
        if(tip==0) printf("%d\n",query(root,1,n,p1,p2));
        else update(root,1,n,p1,p2);
    }
}