#include <fstream>
#include <algorithm>
#define NMAX 100005

using namespace std;

ifstream f("arbint.in");
ofstream g("arbint.out");

int i, n, v[3 * NMAX], nrquiz, st, dr, poz, val, ans, type;

void update(int node, int left, int right)
{
    if (left == right)
    {
        v[node] = val;
        return;
    }

    int mid = (left + right) / 2;

    if (poz <= mid)
        update(2 * node, left, mid);
    else
        update(2 * node + 1, mid + 1, right);

    v[node] = max(v[2 * node], v[2 * node + 1]);
}

void query(int node, int left, int right)
{
    if (st <= left && dr >= right)
    {
        ans = max(ans, v[node]);
        return;
    }

    int mid = (left + right) / 2;

    if (st <= mid)
        query(2 * node, left, mid);

    if (dr > mid)
        query(2 * node + 1, mid + 1, right);
}

int main()
{
    f >> n >> nrquiz;

    for (i = 1; i <= n; ++ i)
    {
        f >> val;
        poz = i;
        update(1, 1, n);
    }



    while (nrquiz)
    {
        nrquiz --;

        f >> type;

        if (type == 0)
        {
            f >> st >> dr;
            ans = -1;
            query(1, 1, n);
            g << ans << '\n';
        }
        else
        {
            f >> poz >> val;
            update(1, 1, n);
        }
    }

    return 0;
}