#include<fstream>
using namespace std;

ifstream cin("arbint.in");
ofstream cout("arbint.out");

int n, m, aint[400001];

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

int query(int nod, int st, int dr, int a, int b)
{
    if(a<=st && dr<=b)
        return aint[nod];
    else
    {
        int mid = (st+dr)/2;
        int rez = 0;
        if(a<=mid)
            rez = max(rez, query(2*nod, st, mid, a, b));
        if(mid+1<=b)
            rez = max(rez, query(2*nod+1, mid+1, dr, a, b));
        return rez;
    }
}

int main()
{
    cin>>n>>m;
    for(int i=1; i<=n; i++)
    {
        int x;
        cin>>x;
        update(i, x, 1, 1, n);
    }
    for(int i=1; i<=m; i++)
    {
        int p, a, b;
        cin>>p>>a>>b;
        if(p)
            update(a, b, 1, 1, n);
        else
        {
            cout<<query(1, 1, n, a, b)<<'\n';
        }
    }
    return 0;
}