#include <cstdio>
#include <algorithm>
using namespace std;
#define TEST 0

int n,m,x,y,arb[1<<18],rs;

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

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

int main(){
    if(TEST)
    {
        freopen("test.in","r",stdin);
        freopen("test.out","w",stdout);
    } else {
        freopen("arbint.in","r",stdin);
        freopen("arbint.out","w",stdout);
    }
    scanf("%d %d",&n,&m);
    for(int i=1;i<=n;i++)
    {
        scanf("%d",&y);
        x = i;
        update(1,1,n);
    }
    int c;
    for(int i=1;i<=m;i++)
    {
        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;
}