//horatiu11
# include <cstdio>
# define nmax 1<<18
using namespace std;
int n,m,arb[nmax],val,poz,a,b,op;
inline void update(int nod, int st, int dr)
{
    int m;
    if(st==dr)
    {
        arb[nod]=val;
        return;
    }
    m=(st+dr)/2;
    if(poz<=m)update(nod*2,st,m);
    else update(nod*2+1,m+1,dr);
    if(arb[nod*2]>arb[nod*2+1])arb[nod]=arb[nod*2];
    else arb[nod]=arb[nod*2+1];
}
inline int query(int nod, int st, int dr)
{
    int m,M1=0,M2=0;
    if(a<=st && dr<=b)return arb[nod];
    m=(st+dr)/2;
    if(a<=m)M1=query(nod*2,st,m);
    if(b>m)M2=query(nod*2+1,m+1,dr);
    if(M1>M2)return M1;
    else return M2;
}
int main()
{
    int i;
    freopen("arbint.in","r",stdin);
    freopen("arbint.out","w",stdout);
    scanf("%d%d",&n,&m);
    for(i=1;i<=n;++i)
    {
        scanf("%d",&val);
        poz=i;
        update(1,1,n);
    }
    for(i=1;i<=m;++i)
    {
        scanf("%d",&op);
        switch(op)
        {
            case 0:
                scanf("%d%d",&a,&b);
                printf("%d\n",query(1,1,n));
                break;
            case 1:
                scanf("%d%d",&poz,&val);
                update(1,1,n);
                break;
        }
    }
    return 0;
}