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

using namespace std;

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

int v[4 * NMAX], i, n, nrquiz, type, a, b, position, value, Left, Right, ans;

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

    int middle = (left + right) / 2;

    if (position <= middle)
        Update(2 * node, left, middle);
    else
        Update(2 * node + 1, middle + 1, right);

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

void Query(int node, int left, int right)
{
    if (Left <= left && Right >= right)
    {
        if (v[node] > ans)
            ans = v[node];
        return;
    }

    int middle = (left + right) / 2;

    if (Left <= middle)
        Query(2 * node, left, middle);

    if (Right > middle)
        Query(2 * node + 1, middle + 1, right);
}

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

    for (i = 1; i <= n; ++ i)
    {
        f >> value;
        position = i;
        Update(1, 1, n);
    }

    while (nrquiz)
    {
        nrquiz --;

        f >> type;

        if (type == 0)
        {
            f >> Left >> Right;

            ans = -1;
            Query(1, 1, n);
            g << ans << '\n';
        }

        if (type == 1)
        {
            f >> position >> value;
            Update(1, 1, n);
        }
    }
    return 0;
}