#include <fstream>

using namespace std;

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

const int Nmax = 1e5 + 5;
int A[4 * Nmax];
int N, M, c, l, r, x, poz, Max;

void update(int node, int poz, int val, int l, int r)
{
    if(l == r)
    {
        A[node] = val;
        return;
    }
    int mid = (l + r) / 2;
    if(mid >= poz)
        update(2 * node, poz, val, l, mid);
    else
        update(2 * node + 1, poz, val, mid + 1, r);
    A[node] = max(A[2 * node], A[2 * node + 1]);
}

void query(int node, int lq, int rq, int l, int r)
{
    if(l <= lq && rq <= r)
    {
        Max = max(Max, A[node]);
        return;
    }
    int mid = (lq + rq) / 2;
    if(mid >= l)
        query(2 * node, lq, mid, l, r);
    if(mid < r)
        query(2 * node + 1, mid + 1, rq, l, r);
}

int main()
{
    in >> N >> M;
    for(int i = 1; i <= N; ++i)
    {
        in >> x;
        update(1, i, x, 1, N);
    }
    while(M--)
    {
        in >> c;
        if(!c)
        {
            in >> l >> r;
            Max = 0;
            query(1, 1, N, l, r);
            out << Max << '\n';
        }
        else
        {
            in >> poz >> x;
            update(1, poz, x, 1, N);
        }
    }
    return 0;
}