#include <iostream>
#include <fstream>
using namespace std;
ifstream f("arbint.in");
ofstream g("arbint.out");
int x, n, m, x1, x2, aint[100001], op;

void update(int n, int left, int right, int pas, int val)
{
    if(left == right)
    {
        aint[n] = val;
        return;
    }

    int mid = (left + right) / 2;
    if(pas <= mid)
        update(2*n, left, mid, pas, val);
    else
        update(2*n + 1, mid + 1, right, pas, val);
    aint[n] = max(aint[2*n], aint[2*n + 1]);
}

int query(int n, int left, int right, int a, int b)
{
    int v1 = 0, v2 = 0;
    if(a <= left && right <= b)
    {
        return aint[n];
    }
    int mid = (left + right) / 2;
    if(a <= mid)
        v1 = query(2 * n, left, mid, a, b);
    if(b > mid)
        v2 = query(2 * n + 1, mid + 1, right, a, b);
    return max(v1, v2);
}

int main()
{
    f>>n>>m;
    for(int i = 1; i <= n; i++)
    {
        f>>x;
        update(1, 1, n, i, x);
    }

    for(int i = 1; i <= m; i++)
    {
        f>>op>>x1>>x2;
        if(op)
            update(1, 1, n, x1, x2);
        else
            g<<query(1, 1, n, x1, x2)<<'\n';
        }

    return 0;
}