#include <fstream>
#define NMAX 100005

using namespace std;
ifstream in("arbint.in");
ofstream out("arbint.out");

int n, m, i, j, op, a, b;
int v[NMAX];
int aint[NMAX * 4];

void build(int node, int nleft, int nright)
{
    if (nleft == nright)
    {
        aint[node] = v[nleft];
        return ;
    }
    int nmid = (nleft + nright) / 2;
    int leftson = node + 1;
    int rightson = node + 2 * (nmid - nleft + 1);

    build(leftson, nleft, nmid);
    build(rightson, nmid + 1, nright);

    aint[node] = max(aint[leftson], aint[rightson]);
}

int query(int node, int nleft, int nright, int qleft, int qright)
{
    if(qleft <= nleft && qright >= nright)
        return aint[node];

    int nmid = (nleft + nright) / 2;
    int leftson = node + 1;
    int rightson = node + 2 * (nmid - nleft + 1);
    int rez = 0;

    if (qleft <= nmid)
        rez = query(leftson, nleft, nmid, qleft, qright);
    if (nmid < qright)
        rez = max(rez, query(rightson, nmid + 1, nright, qleft, qright));

    return rez;
}

void update(int node, int nleft, int nright, int poz, int val)
{
    if(nleft == nright)
    {
        aint[node] = val;
        return ;
    }
    int nmid = (nleft + nright) / 2;
    int leftson = node + 1;
    int rightson = node + 2 * (nmid - nleft + 1);

    if (poz <= nmid)
        update(leftson, nleft, nmid, poz, val);
    else
        update(rightson, nmid + 1, nright, poz, val);
    aint[node] = max(aint[leftson], aint[rightson]);
}

int main()
{
    in >> n >> m;
    for (i = 0; i < n; ++i)
    {
        in >> v[i];
    }

    build(0, 0, n - 1);

    for (j = 1; j <= m; ++j)
    {
        in >> op >> a >> b;
        if (op == 0)
        {
            out << query(0, 0, n - 1, a - 1, b - 1) << '\n';
        }
        else if (op == 1)
        {
            update(0, 0, n - 1, a - 1, b);
        }
    }
    return 0;
}