#include <fstream>

using namespace std;

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

int N, M;
int Aint[2 * 100005];
int A, B, val, poz, ans;

void modify(int p, int value)
{
    for (Aint[p += N] = value; p > 1; p >>= 1)
        Aint[p >> 1] = max(Aint[p], Aint[p ^ 1]);
}

int query(int l, int r)
{
    int res = 0;
    for (l += N, r += N; l < r; l >>= 1, r >>= 1)
    {
        if (l & 1)
            res = max (res, Aint[l++]);
        if (r & 1)
            res = max(res, Aint[--r]);
    }
    return res;
}

int main()
{
    f >> N >> M;
    for (int i = 1; i <= N; ++i)
    {
        f >> val;
        modify(i , val);
    }
    for (int i = 1; i <= M; ++i)
    {
        int tip;
        f >> tip;
        if (tip == 0)
        {
            f >> A >> B;
            g << query(A, B + 1) << "\n";
        }
        else
        {
            f >> poz >> val;
            modify(poz, val);
        }
    }
    f.close();
    g.close();
    return 0;
}