#include <iostream>
using namespace std;

int arb[400005];

void update(int nod, int st, int dr, int poz, int val)
{
    if(st > dr)
    {
        return;
    }

    if(st == dr)
    {
        arb[nod] = val;
        return;
    }

    int m = (st + dr) / 2;

    if(poz <= m)
    {
        update(nod * 2, st, m, poz, val);
    }
    else
    {
        update(nod * 2 + 1, m + 1, dr, poz, val);
    }

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

int query(int nod, int st, int dr, int a, int b)
{
    if(a <= st && dr <= b)
    {
        return arb[nod];
    }

    int m = (st + dr) / 2, maxim = 0;

    if(a <= m)
    {
        maxim = max(maxim, query(nod * 2, st, m, a, b));
    }

    if(b > m)
    {
        maxim = max(maxim, query(nod * 2 + 1, m + 1, dr, a, b));
    }

    return maxim;
}

int main()
{
    //freopen("arbint.in", "r", stdin);
    //freopen("arbint.out", "w", stdout);

    int n, m;
    cin >> n >> m;

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

    for(int i = 1; i <= m; i++)
    {
        int tip, a, b;
        cin >> tip >> a >> b;

        if(tip == 0)
        {
            cout << query(1, 1, n, a, b) << "\n";
        }
        else
        {
            update(1, 1, n, a, b);
        }
    }
    return 0;
}