#include <stdio.h>
#include <stdlib.h>

#define dim 100000

int tree[4*dim+5];
int v[dim+5];

int maxim(int a,int b){
    return (a<b)?b:a;
}

void build(int node,int l,int r){
    if(l==r){
        tree[node]=v[l];
        return;
    }
    int m=(l+r)/2;
    build(2*node,l,m);
    build(2*node+1,m+1,r);
    tree[node]=maxim(tree[2*node],tree[2*node+1]);
}

void update(int node,int l,int r,int pos,int val){
    if(l==r){
        tree[node]=val;
        return;
    }
    int m=(l+r)/2;
    if(pos<=m){
        update(2*node,l,m,pos,val);
    }
    else{
        update(2*node+1,m+1,r,pos,val);
    }
    tree[node]=maxim(tree[2*node],tree[2*node+1]);
}

void search(int node,int l,int r,int a,int b,int *maxim){
    if(a<=l && b>=r){
        *maxim = (*maxim<tree[node])?tree[node]:*maxim;
        return;
    }
    int m=(l+r)/2;
    if(a<=m){
        search(2*node,l,m,a,b,maxim);
    }
    if(b>m){
        search(2*node+1,m+1,r,a,b,maxim);
    }
}

int main()
{
    FILE *f,*g;
    f=fopen("arbint.in","r");
    g=fopen("arbint.out","w");
    int x,a,b,n,m;
    fscanf(f,"%d%d",&n,&m);
    for(int i=1;i<=n;++i){
        fscanf(f,"%d",&v[i]);
        build(1,1,n);
    }
    for(int i=1;i<=m;++i){
        fscanf(f,"%d%d%d",&x,&a,&b);
        if(x==1){
            update(1,1,n,a,b);
        }
        else{
            int maxim=0;
            search(1,1,n,a,b,&maxim);
            fprintf(g,"%d\n",maxim);
        }
    }
    fclose(f);
    fclose(g);
    return 0;
}