#include <bits/stdc++.h>

using namespace std;
const int NMAX = 100000 +10;
int a[NMAX],n,m,instr,aA,b,arb[4*NMAX];
inline int query(int nod,int finst,int findr,int st,int dr)
{
    if (st>=finst&&dr<=findr)
        return arb[nod];
    int mij=(st+dr)>>1;

    int maX = 0,val1=0,val2=0;
    if (finst<=mij)
    {
        val1=query(nod*2,finst,findr,st,mij);
    }
    if (mij<findr)val2=query(nod*2+1,finst,findr,mij+1,dr);
    return max(val1,val2);
}
inline void update(int nod,int st,int dr,int poz,int val)
{
    if (st==dr)
    {
        arb[nod] = val;
        return ;
    }
    int mij=(st+dr)>>1;
    if (poz<=mij)update(nod*2,st,mij,poz,val);
    else update(nod*2+1,mij+1,dr,poz,val);
    arb[nod]=max(arb[2*nod],arb[2*nod+1]);
}
int main()
{
    freopen("arbint.in","r",stdin);
    freopen("arbint.out","w",stdout);
    scanf("%d %d\n", &n,&m);
    for (int i = 1 ; i<=n ; ++i)
        scanf("%d\n", &a[i]);
    for (int i = 1 ; i<=n ; ++i)
        update(1,1,n,i,a[i]);
    for (int i = 1 ; i<=m ; ++i)
    {
        scanf("%d %d %d\n",&instr,&aA,&b);
        if (instr==0)
        {
            printf("%d\n",query(1,aA,b,1,n));
            continue ;
        }
        update(1,1,n,aA,b);
    }
    return 0;
}