#include<cstdio>
#include<algorithm>
#define N_MAX 200010
#define INF 2000000000
using namespace std;
int A[N_MAX],T[N_MAX],MAX,N,M;
inline void Qwerry(int nod,int st,int dr,int x,int y)
{
    if (x<=st && y>=dr) {MAX=max(MAX,T[nod]);return;};
    int mij=(st+dr)>>1;
    if (x<=mij) Qwerry(nod*2,st,mij,x,y);
    if (y>mij) Qwerry(nod*2+1,mij+1,dr,x,y);
}
inline void Load(int nod,int x,int y,int p)
{
    if (x==y) {T[nod]=A[p];return;}
    int mij=(x+y)>>1;
    if (p<=mij) Load(nod*2,x,mij,p);
        else   Load(nod*2+1,mij+1,y,p);
    T[nod]=max(T[nod*2],T[nod*2+1]);
}
int main()
{
    freopen("arbint.in","r",stdin);
    freopen("arbint.out","w",stdout);
    scanf("%d%d",&N,&M);
    A[0]=-INF;
    for (int i=1;i<=N;++i)
        scanf("%d",&A[i]), Load(1,1,N,i);
    for (int i=1;i<=M;++i)
    {
        int k,x,y;
        scanf("%d%d%d",&k,&x,&y);
        if (k) {A[x]=y; Load(1,1,N,x);}
            else {MAX=-INF; Qwerry(1,1,N,x,y); printf("%d\n",MAX);}
    }
    fclose(stdin);
    fclose(stdout);
    return 0;
}