#include <fstream>

using namespace std;
ifstream fi("arbint.in");
ofstream fo("arbint.out");
const int nmax=1e5;
int n, m, x;
int sgt[4*nmax+5];

void update(int nod, int st, int dr, int pos, int val)
{
    if(st==dr)
    {
        sgt[nod]=val;
        return;
    }
    int mid=(st+dr)/2;
    if(pos<=mid)
        update(2*nod, st, mid, pos, val);
    else
        update(2*nod+1, mid+1, dr, pos, val);
    sgt[nod]=max(sgt[2*nod], sgt[2*nod+1]);
}

int maxim(int nod, int st, int dr, int a, int b)
{
    if(dr<a || b<st)
        return 0;
    if(a<=st && dr<=b)
        return sgt[nod];
    int mid=(st+dr)/2;
    return max(maxim(2*nod, st, mid, a, b), maxim(2*nod+1, mid+1, dr, a, b));
}

int main()
{
    fi>>n>>m;
    for(int i=1; i<=n; i++)
    {
        fi>>x;
        update(1, 1, n, i, x);
    }

    while(m--)
    {
        int q, a, b;
        fi>>q>>a>>b;
        if(q==0)
            fo<<maxim(1, 1, n, a, b)<<"\n";
        else
            update(1, 1, n, a, b);
    }

    fi.close();
    fo.close();
    return 0;
}