#include <iostream>
#include <fstream>
using namespace std;
ifstream f("arbint.in");
ofstream g("arbint.out");
#define N_MAX 100005
int n, m, aint[4 * N_MAX], val, poz;
void build(int nod, int st, int dr)
{
    if(st == dr)
    {
        f >> aint[nod];
        return;
    }
    int l = nod * 2;
    int r = nod * 2 + 1;
    int mid = (st + dr) / 2;
    build(l, st, mid);
    build(r, mid + 1, dr);
    aint[nod] = max(aint[l], aint[r]);
}

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

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

    int l = nod * 2;
    int r = nod * 2 + 1;
    int mid = (st + dr) / 2;

    if(mid >= b)
        return query(l, st, mid);
    else
    if(mid < a)
        return query(r, mid + 1, dr);
    else return max(query(l, st, mid), query(r, mid + 1, dr));
}

int main()
{
    int p;
    f >> n >> m;
    build(1,1,n);
    while(m--)
    {
        f >> p;
        if(p == 0)
        {
            f >> a >> b;
            g << query(1,1,n) << "\n";
        }
        else
        {
            f >> poz >> val;
            update(1,1,n);
        }
    }
    return 0;
}