#include <fstream>

using namespace std;

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

const int Nmax = 100005;

int n, m, v[Nmax], arb[4 * Nmax];

void build(int nod, int st, int dr)
{
    if (st == dr)
    {
        arb[nod] = v[st];
        return;
    }

    int mid = (st + dr) / 2;
    build(2 * nod, st, mid);
    build(2 * nod + 1, mid + 1, dr);

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

void update(int nod, int st, int dr, int poz, int val)
{
    if (st == dr)
    {
        arb[nod] = val;
        return;
    }

    int mid = (st + dr) / 2;
    if (poz <= mid)
        update(2 * nod, st, mid, poz, val);
    else
        update(2 * nod + 1, mid + 1, dr, poz, val);

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

int query(int nod, int st, int dr, int x, int y)
{
    // interval complet in afara
    if (dr < x || st > y)
        return 0;

    // interval complet inclus
    if (st >= x && dr <= y)
        return arb[nod];

    // interval partial
    int mid = (st + dr) / 2;
    int a = query(2 * nod, st, mid, x, y);
    int b = query(2 * nod + 1, mid + 1, dr, x, y);
    return max(a, b);
}

int main()
{
    cin >> n >> m;
    for (int i = 1; i <= n; i++)
        cin >> v[i];

    build(1, 1, n);

    while (m--)
    {
        int op, a, b;
        cin >> op >> a >> b;
        if (op == 1)
            update(1, 1, n, a, b);
        if (op == 0)
        {
            int maxi = query(1, 1, n, a, b);
            cout << maxi << "\n";
        }
    }
    return 0;
}