#include <iostream>
#include <fstream>
#define MAXN 100000
using namespace std;
ifstream fin("arbint.in");
ofstream fout("arbint.out");
int arb[MAXN*4], i, n, m, val, x, y;

void update (int node, int st, int dr, int poz, int val)
{
    if(st==dr)
    {
        arb[node]=val;
        return;
    }
    int mij=(st+dr)/2;// intervalele in care se sparge nodul sunt (st,mij), si (mij+1, dr). Pt fiul stang avem node*2 si pt cel drept node*2+1
    if(poz<=mij)
        update(node*2,st,mij,poz,val);
    else
        update(node*2+1,mij+1,dr,poz,val);
    arb[node]=max(arb[node*2],arb[node*2+1]);
}
int query(int node, int st, int dr, int x, int y)
{
    if(x<=st && dr<=y)//inseamna ca e tot inclus
        return arb[node];
    int ret=-(1<<31)+1, mij=(st+dr)/2;
    if(x<=mij)
        ret=max(ret,query(node*2,st,mij,x,y));
    if(mij+1<=y)
        ret=max(ret,query(node*2+1,mij+1,dr,x,y));
    return ret;
}
int main()
{
    fin>>n>>m;
    for(i=1;i<=n;i++)
    {
        fin>>val;
        update(1,1,n,i,val);
    }
    for(i=1;i<=m;i++)
    {
        fin>>val>>x>>y;
        if(val==0)
            fout<<query(1,1,n,x,y)<<'\n';
        else  update(1,1,n,x,y);
    }
    return 0;
}