#include <iostream>
#include <fstream>
using namespace std;
#define nmax 100010
ifstream f("arbint.in");
ofstream g("arbint.out");
int aint[nmax*4];

void build(int nod,int st,int dr)
{
    if(st==dr)
    {
        f>>aint[nod];
        return;
    }

    int left=nod*2,right=nod*2+1;
    int mid=(st+dr)/2;

    build(left,st,mid);
    build(right,mid+1,dr);

    aint[nod]=max(aint[left],aint[right]);
}

void update(int nod,int st,int dr,int pos,int val)
{
    if(st==dr) /// st==dr==pos
    {
        aint[nod]=val;
        return;
    }

    int left=nod*2,right=nod*2+1;
    int mid=(st+dr)/2;

    if(pos<=mid) update(left,st,mid,pos,val);
    else update(right,mid+1,dr,pos,val);

    aint[nod]=max(aint[left],aint[right]);
}

int query(int nod,int st,int dr,int x,int y)
{
    if(x<=st && dr<=y) return aint[nod];

    int left=nod*2,right=nod*2+1;
    int mid=(st+dr)/2;

    if(y<=mid) return query(left,st,mid,x,y);
    else if(x>mid) return query(right,mid+1,dr,x,y);
    return max(query(left,st,mid,x,y),query(right,mid+1,dr,x,y));
}

int main()
{
    int n,q,p,x,y;
    f>>n>>q;
    build(1,1,n);
    for(int i=1;i<=q;i++)
    {
        f>>p>>x>>y;
        if(p==1) update(1,1,n,x,y);
        else g<<query(1,1,n,x,y)<<'\n';
    }
    return 0;
}