#include <cstdio>
#include<algorithm>
using namespace std;

#define BM 100005
int n,m, a[BM*4+100];

void u(int nod,int st,int dr,int poz,int val){
    if(st==dr){
        a[nod]=val;
        return;
    }
    int m=(st+dr)/2;
    if(poz<=m)u(2*nod,st,m,poz,val);
    else u(2*nod+1,m+1,dr,poz,val);
    a[nod]=max(a[2*nod],a[2*nod+1]);
}
int q(int nod,int st,int dr,int aa,int b){
    int mx=0;
    if(st>=aa&&dr<=b)mx=max(mx,a[nod]);
    else {
        int m=(st+dr)/2;
        if(aa<=m)mx=max(mx, q(nod*2,st,m,aa,b));
        if(b>m)mx=max(mx, q(nod*2+1,m+1,dr,aa,b));
    }
    return mx;
}
int main(){
    int i,p=1,x,op,ls,ld;
    freopen("arbint.in","r",stdin);
    freopen("arbint.out","w",stdout);
    scanf("%d %d",&n,&m);
    for(i=1;i<=n;++i){
        scanf("%d",&x);
        u(1,1,n,i,x);
    }
    for(i=1;i<=m;++i){
        scanf("%d %d %d",&op,&ls,&ld);
        if(op==1)u(1,1,n,ls,ld);
        else printf("%d\n",q(1,1,n,ls,ld));
    }
    return 0;
}