#include <fstream>
using namespace std;

const int nMax = 100000;
int vec[nMax + 5], aint[4 * nMax + 5], Max;

void build(int k, int left, int right)
{
    if (left == right)
    {
        aint[k] = vec[left];
        return;
    }

    int mid = left + (right - left) / 2;
    build(2 * k, left, mid);
    build(2 * k + 1, mid + 1, right);
    aint[k] = max(aint[2*k], aint[2*k+1]);
}

void update(int k, int left, int right, int pos, int value)
{
    if (left == right)
    {
        aint[k] = value;
        return;
    }

    int mid = left + (right - left) / 2;
    if (pos <= mid)
        update(2 * k, left, mid, pos, value);
    else
        update(2 * k + 1, mid + 1, right, pos, value);
    aint[k] = max(aint[2*k], aint[2*k+1]);
}

void query(int k, int left, int right, int intLeft, int intRight)
{
    if (intLeft <= left && right <= intRight)
    {
        Max = max(Max, aint[k]);
        return;
    }
    else if (right < intLeft || left > intRight)
        return;

    int mid = left + (right - left) / 2;
    query(2 * k, left, mid, intLeft, intRight);
    query(2 * k + 1, mid + 1, right, intLeft, intRight);
}

int main()
{
    ifstream fin("arbint.in");
    ofstream fout("arbint.out");

    int n, q;
    fin >> n >> q;
    for (int i = 1; i <= n; ++i)
        fin >> vec[i];
    build(1,1,n);
    for (int i = 1; i <= q; ++i)
    {
        int num, a, b;
        fin >> num >> a >> b;
        if (num == 0)
        {
            Max = 0;
            query(1,1,n,a,b);
            fout << Max << '\n';
        }
        else if (num == 1)
            update(1,1,n,a,b);
    }
}