#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("arbint.in");
ofstream fout("arbint.out");

int arb[4*100000+5], n;

void Update(int pos, int val, int left=1, int right=n, int node=1)
{
    if (left == right)
    {
        arb[node] = val;
        return;
    }

    int mid = (left + right) / 2;
    if (pos <= mid)
        Update(pos, val, left, mid, 2 * node);
    else
        Update(pos, val, mid + 1, right, 2 * node + 1);

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

int Query(int x, int y, int left = 1, int right = n, int node = 1)
{
    if (x <= left && right <= y)
        return arb[node];

    int mid = (left + right) / 2, al = 0, ar = 0;

    if (x <= mid)
        al = Query(x, y, left, mid, 2 * node);
    else
        ar = Query(x, y, mid + 1, right, 2 * node + 1);

    return max(al, ar);
}

int main()
{
    int m;
    fin >> n >> m;

    for (int i=1; i<=n; i++)
    {
        int a;
        fin >> a;
        Update(i, a);
    }

    for (int i=0; i<m; i++)
    {
        int x,a,b;
        fin>>x>>a>>b;
        if (x==0)
        {
            fout << Query(a, b) << '\n';
        }
        else
        {
            Update(a, b);
        }
    }


    return 0;
}