#include <iostream>
#include <fstream>

using namespace std;
int v[100005];
int aint[400005];

int join(int a, int b)
{
    return max(a, b);
}

void build(int l, int r, int cr)
{
    if (l==r){aint[cr]=v[l]; return;}
    int mid=(l+r)/2;
    build (l, mid, 2*cr);
    build (mid+1, r, 2*cr+1);
    aint[cr]=join(aint[2*cr], aint[2*cr+1]);
}

int quewy(int ql, int qr, int l, int r, int cr)
{
    if (ql<=l&&r<=qr)
        return aint[cr];
    int mid=(l+r)/2;
    if (mid<ql)
        return quewy(ql, qr, mid+1, r, 2*cr+1);
    if (mid>=qr)
        return quewy(ql, qr, l, mid, 2*cr);
    return join(quewy(ql, qr, l, mid, 2*cr), quewy(ql, qr, mid+1, r, 2*cr+1));
}

void update(int l, int r, int poz, int val, int cr)
{
    if (l==r) {aint[cr]=val; return;}
    int mid=(l+r)/2;
    if (poz<=mid)
        update(l, mid, poz, val, 2*cr);
    else
        update(mid+1, r, poz, val, 2*cr+1);
    aint[cr]=join(aint[2*cr], aint[2*cr+1]);
    return;
}

int main()
{
    ifstream cin ("arbint.in");
    ofstream cout ("arbint.out");
    int n, q, tip, a, b;
    cin>>n>>q;
    for (int i=1; i<=n; i++){cin>>v[i];}
    build(1, n, 1);
    for (int i=1; i<=q; i++)
    {
        cin>>tip>>a>>b;
        if (tip==0)
        {
            cout<<quewy(a, b, 1, n, 1)<<'\n';
        }
        else if (tip==1)
        {
            update(1, n, a, b, 1);
        }
    }
}