#include <cstdio>
#include <iostream>

using namespace std;

const int N=100000+5;

pair<int,int>arb[3*N];

inline void upd(int nod,int st,int dr,int poz,int val)
{
    if(dr<poz || poz<st)
    {
        return;
    }
    if(st==dr)
    {
        arb[nod]={val,poz};
        return;
    }
    int med=(st+dr)/2;
    upd(2*nod,st,med,poz,val);
    upd(2*nod+1,med+1,dr,poz,val);
    arb[nod]=max(arb[2*nod],arb[2*nod+1]);
}

inline pair<int,int>ask(int nod,int st,int dr,int x,int y)
{
    if(dr<x || y<st)
    {
        return {-(1<<30),0};
    }
    if(x<=st && dr<=y)
    {
        return arb[nod];
    }
    int med=(st+dr)/2;
    return max(ask(2*nod,st,med,x,y),ask(2*nod+1,med+1,dr,x,y));
}

int main()
{
    freopen("arbin.in","r",stdin);
    freopen("arbin.out","w",stdin);
    register int n,q,x,i;
    scanf("%d%d",&n,&q);
    for(i=1;i<=n;i++)
    {
        scanf("%d",&x);
        upd(1,1,n,i,x);
    }
    register int t,a,b;
    register pair<int,int>ans;
    while(q--)
    {
        scanf("%d%d%d",&t,&a,&b);
        if(t==1)
        {
            upd(1,1,n,a,b);
        }
        else
        {
            ans=ask(1,1,n,a,b);
            printf("%d\n",ans.first); /// at poz ans.second
        }
    }
    return 0;
}