#include <iostream>
#include <fstream>
#include <algorithm>

#define nmax 100005
using namespace std;

int n,m;
int arb[nmax*4];
int s[nmax];
int a,b;
void interval(int n,int st,int dr);

void read()
{
    scanf("%d %d",&n,&m);
    for(int i=1;i<=n;i++)
        scanf("%d ",&s[i]);
    interval(1,1,n);
}

void interval(int n,int st,int dr)
{
    if(st==dr)
        {arb[n]=s[st];
        return;}
    int mij=st+dr;
    mij/=2;
    interval(2*n,st,mij);
    interval(2*n+1,mij+1,dr);
    arb[n]=max(arb[2*n],arb[2*n+1]);
}
int maxim;
void search_arb(int st,int dr,int n)
{
    if(a<=st && dr<=b)
        {maxim=max(maxim,arb[n]);
        return;}
    int mij=(st+dr)/2;
    if(a<=mij)
        search_arb(st,mij,2*n);
    if(b>mij)
        search_arb(mij+1,dr,2*n+1);
}
void task_0()
{
    scanf("%d %d",&a,&b);
    maxim=0;
    search_arb(1,n,1);
    printf("%d\n",maxim);
}

void task_1()
{
    scanf("%d %d",&a,&b);
    s[a]=b;
    interval(1,1,n);
}
int main()
{
    freopen("arbint.in","r",stdin);
    freopen("arbint.out","w",stdout);
    read();
    int c;
    for(int i=1;i<=m;i++)
        {scanf("%d ",&c);
        if(c==0)
            task_0();
        else task_1();}
    return 0;
}