#include <algorithm>
#include <fstream>
#define DIM 100010

using namespace std;

int answer;
int n, q, v[DIM], aint[4 * DIM];

inline int LeftSon(const int &x)
{
    return 2 * x;
}

inline int RightSon(const int &x)
{
    return 2 * x + 1;
}

void Build(int nod, int left, int right)
{
    if (left == right)
    {
        aint[nod] = v[left];
        return;
    }
    int mid = (left + right) / 2;
    Build(LeftSon(nod), left, mid);
    Build(RightSon(nod), mid + 1, right);
    aint[nod] = max(aint[LeftSon(nod)], aint[RightSon(nod)]);
}

void Update(int nod, int left, int right, const int &val, const int &poz)
{
    if (left == right)
    {
        aint[nod] = val;
        v[poz] = val;
        return;
    }
    int mid = (left + right) / 2;
    if (poz <= mid)
        Update(LeftSon(nod), left, mid, val, poz);
    else
        Update(RightSon(nod), mid + 1, right, val, poz);
    aint[nod] = max(aint[LeftSon(nod)], aint[RightSon(nod)]);
}

void Query(int nod, int left, int right, const int &LeftQuery, const int &RightQuery)
{
    if (LeftQuery <= left && right <= RightQuery)
    {
        answer = max(answer, aint[nod]);
        return;
    }
    int mid = (left + right) / 2;
    if (LeftQuery <= mid)
        Query(LeftSon(nod), left, mid, LeftQuery, RightQuery);
    if (RightQuery >= mid + 1)
        Query(RightSon(nod), mid + 1, right, LeftQuery, RightQuery);
}

int main()
{
    ifstream f("arbint.in");
    ofstream g("arbint.out");
    f >> n >> q;
    for (int i = 1;i <= n;++i)
        f >> v[i];
    Build(1, 1, n);
    for (int i = 1;i <= q;++i)
    {
        int id;
        f >> id;
        switch(id)
        {
            case 0:
            {
                int left, right;
                f >> left >> right;
                answer = 0;
                Query(1, 1, n, left, right);
                g << answer << "\n";
                break;
            }
            case 1:
            {
                int poz, val;
                f >> poz >> val;
                Update(1, 1, n, val, poz);
                break;
            }
        }
    }
    f.close();
    g.close();
    return 0;
}