#include <cstdio>
#include <algorithm>
#define MAX 1<<18
using namespace std;
int n,m,x,y,A[MAX],rasp;

void update(int n,int l,int r){
    if(l==r){
        A[n]=y;
        return; }
    int md=(l+r)/2;
    if(x<=md)update(2*n,l,md); else
             update(2*n+1,md+1,r);
    A[n]=max(A[2*n],A[2*n+1]);
}

void query(int n,int l,int r){
    if(x<=l&&r<=y){
        rasp=max(rasp,A[n]);
        return ; }
    int md=(l+r)/2;
    if(x<=md)query(2*n,l,md);
    if(y>md)query(2*n+1,md+1,r);
}

int main(){
    int 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<=n;i++)
        {
            scanf("%d %d %d",&c,&x,&y);
            if(c==1) update(1,1,n); else
            {
                rasp=0;
                query(1,1,n);
                printf("%d\n",rasp);
            }
        }
}