#include <cstdio>
#include <algorithm>

using namespace std;

int arb[400000];

void arbint_update(int nod,int st,int dr,int poz,int val)
{
    if(st==dr) arb[nod]=val;
    else
    {
        int mid=(st+dr)/2;
        if(poz<=mid) arbint_update(nod*2,st,mid,poz,val);
        else arbint_update(nod*2+1,mid+1,dr,poz,val);
        arb[nod]=max(arb[nod*2],arb[nod*2+1]);
    }
}

int arbint_query(int nod,int st,int dr,int left,int right)
{
    if(left<=st && dr<=right) return arb[nod];
    else
    {
        int mid=(st+dr)/2,sol=0;
        if(left<=mid) sol=max(sol,arbint_query(nod*2,st,mid,left,right));
        if(mid+1<=right) sol=max(sol,arbint_query(nod*2+1,mid+1,dr,left,right));
        return sol;
    }
}

int main()
{
    freopen("arbint.in","r",stdin);
    freopen("arbint.out","w",stdout);
    int n,m,x,a,b;
    scanf("%d%d",&n,&m);
    for(int i=1;i<=n;i++)
    {
        scanf("%d",&x);
        arbint_update(1,1,n,i,x);
    }
    for(int i=1;i<=m;i++)
    {
        scanf("%d%d%d",&x,&a,&b);
        if(x==0) printf("%d\n",arbint_query(1,1,n,a,b));
        if(x==1) arbint_update(1,1,n,a,b);
    }
    return 0;
}