#include <fstream>
using namespace std;

ifstream fin("arbint.in");
ofstream fout("arbint.out");

int n, m, x, a, b, arb[400400];

void update(int nod, int l, int r, int pos, int val)
{
    if(l==r)
    {
        arb[nod]=val;
        return;
    }

    int mid=(l+r)/2;
    if(pos<=mid)
        update(2*nod, l, mid, pos, val);
    else
        update(2*nod+1, mid+1, r, pos, val);

    arb[nod]=max(arb[2*nod], arb[2*nod+1]);
}

int query(int nod, int l, int r, pair<int,int> inv)
{
    if(inv.first<=l && r<=inv.second)
        return arb[nod];

    int mid=(l+r)/2, mx=0;
    if(inv.first<=mid)
        mx=max(mx, query(2*nod, l, mid, inv));
    if(mid<inv.second)
        mx=max(mx, query(2*nod+1, mid+1, r, inv));

    return mx;
}

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

    for(int i=0;i<m;++i)
    {
        fin>>x>>a>>b;

        if(x==0)
            fout<<query(1, 1, n, make_pair(a, b))<<'\n';
        else if(x==1)
            update(1, 1, n, a, b);
    }

    return 0;
}