#include <cstdio>
#include <algorithm>
using namespace std;
#define MAX 1<<18

int n,a[MAX],rs,x,y;

void update(int n,int l,int r){
    if( l == r )
    {
        a[n] = y;
        return;
    }
        int m = (l+r)/2;
        if( x <= m ) update(2*n,l,m); else
        update(2*n+1,m+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 )
    {
        rs = max( rs, a[n] );
        return ;
    }
        int m = (l+r)/2;
        if( x <= m )query(2*n,l,m);
        if( y > m )query(2*n+1,m+1,r);
}

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